Computational aspects of greedy partitioning of graphs
DOI10.1007/S10878-017-0185-2zbMATH Open1385.68016DBLPjournals/jco/Borowiecki18OpenAlexW2767308712WikidataQ59610242 ScholiaQ59610242MaRDI QIDQ1702844FDOQ1702844
Authors: Piotr Borowiecki 
Publication date: 1 March 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0185-2
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Obstructions for three-coloring graphs with one forbidden induced subgraph
- Graph Classes: A Survey
- Title not available (Why is that?)
- Some perfect coloring properties of graphs
- Title not available (Why is that?)
- Some simplified NP-complete graph problems
- On-line 3-chromatic graphs. II: Critical graphs
- Title not available (Why is that?)
- Results on the Grundy chromatic number of graphs
- New potential functions for greedy independence and coloring
- A lower bound for approximating the Grundy number
- Constructions of \(k\)-critical \(P_5\)-free graphs
- On-line P-coloring of graphs
- The complexity of generalized graph colorings
- New bounds for the chromatic number of graphs
- On the computational complexity of (O,P)-partition problems
- Dynamic coloring of graphs
- Title not available (Why is that?)
- A note on first-fit coloring of interval graphs
- Title not available (Why is that?)
- First-fit coloring of bounded tolerance graphs
- On the Grundy number of graphs with few \(P_4\)'s
- New upper bounds for the chromatic number of a graph
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
- An interpolation theorem for partitions which are complete with respect to hereditary properties
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
- On Computational Aspects of Greedy Partitioning of Graphs
Cited In (11)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized coloring of permutations
- Title not available (Why is that?)
- Generalized Coloring of Permutations
- Dynamic \(F\)-free coloring of graphs
- Title not available (Why is that?)
- Graph classes generated by Mycielskians
- Title not available (Why is that?)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
- On generalized greedy splitting algorithms for multiway partition problems
Uses Software
This page was built for publication: Computational aspects of greedy partitioning of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702844)
