Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610): Difference between revisions

@@ label / en / label / en @@
+Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
@@ Property / DOI @@
-.4230/LIPIcs.ESA.2018.47
@@ Property / DOI: 10.4230/LIPIcs.ESA.2018.47 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+gCol
@@ Property / describes a project that uses: gCol / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Colorings and orientations of graphs
@@ Property / cites work: Colorings and orientations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on graph colorings and graph polynomials
@@ Property / cites work: A note on graph colorings and graph polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607947
@@ Property / cites work: Q4607947 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5369515
@@ Property / cites work: Q5369515 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for exact satisfiability and number of perfect matchings
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Hamiltonicity Checking Via Bases of Perfect Matchings
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Gröbner bases and graph colorings
@@ Property / cites work: Gröbner bases and graph colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
+Normal rank
@@ Property / cites work @@
+Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
+Normal rank
@@ Property / cites work @@
+Intractability of Clique-Width Parameterizations
@@ Property / cites work: Intractability of Clique-Width Parameterizations / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Modular-Width
@@ Property / cites work: Parameterized Algorithms for Modular-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth
+Normal rank
@@ Property / cites work @@
+Cutwidth: obstructions and algorithmic aspects
@@ Property / cites work: Cutwidth: obstructions and algorithmic aspects / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607896
@@ Property / cites work: Q4607896 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank
@@ Property / cites work @@
+Tree-width, path-width, and cutwidth
@@ Property / cites work: Tree-width, path-width, and cutwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365080
@@ Property / cites work: Q5365080 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding the Independence Number of a Graph
@@ Property / cites work: Bounding the Independence Number of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133994
@@ Property / cites work: Q4133994 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247451
@@ Property / cites work: Q4247451 / rank @@
+Normal rank
@@ Property / cites work @@
+Between treewidth and clique-width
@@ Property / cites work: Between treewidth and clique-width / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+Cutwidth I: A linear time fixed parameter algorithm
+Normal rank
@@ Property / cites work @@
+Cutwidth II: Algorithms for partial w-trees of bounded degree
+Normal rank
@@ Property / OpenAlex ID @@
+W2963291540
@@ Property / OpenAlex ID: W2963291540 / rank @@
+Normal rank
@@ Property / title @@
+Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.ESA.2018.47
@@ Property / DOI: 10.4230/LIPICS.ESA.2018.47 / rank @@
+Normal rank