The following pages link to Algorithms and Computation (Q5191672):
Displaying 15 items.
- Improper C-colorings of graphs (Q629357) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- The balanced satisfactory partition problem (Q831826) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- Min-max communities in graphs: complexity and computational properties (Q899313) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Aspects of upper defensive alliances (Q2026328) (← links)
- A note on the satisfactory partition problem: constant size requirement (Q2094373) (← links)
- Asymptotically almost every \(2r\)-regular graph has an internal partition (Q2303426) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
- The satisfactory partition problem (Q2495904) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- Stabilization Time in Weighted Minority Processes (Q5090505) (← links)
- (Dis)assortative partitions on random regular graphs (Q5877003) (← links)
- Parameterized complexity of satisfactory partition problem (Q5918491) (← links)
