scientific article; zbMATH DE number 1830756
From MaRDI portal
Publication:4778579
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
- Small Maximal Independent Sets and Faster Exact Graph Coloring
- Maximal independent sets in minimum colorings
- Maximum colorful independent sets in vertex-colored graphs
- Coloring large graphs based on independent set extraction
- Enumerating maximal independent sets with applications to graph colouring.
- Approximating minimum coloring and maximum independent set in dotted interval graphs
- Extremal colorings and independent sets
- Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
- On the number of maximal independent sets in minimum colorings of split graphs
- Building a maximal independent set for the vertex-coloring problem on planar graphs
Cited in
(15)- Efficiency in exponential time for domination-type problems
- Coloring large graphs based on independent set extraction
- An exact algorithm for the channel assignment problem
- Vertex coloring of a graph for memory constrained scenarios
- Path Problems in Complex Networks
- Improved Exact Algorithms for Counting 3- and 4-Colorings
- Small Maximal Independent Sets and Faster Exact Graph Coloring
- scientific article; zbMATH DE number 889953 (Why is no real title available?)
- Faster graph coloring in polynomial space
- A piecewise approach for the analysis of exact algorithms
- A piecewise approach for the analysis of exact algorithms
- Enumerating maximal independent sets with applications to graph colouring.
- Breaking the 2ⁿ barrier for 5-coloring and 6-coloring
- Faster edge coloring by partition sieving
- Approximation of min coloring by moderately exponential algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778579)
