Complexity of independent set reconfigurability problems (Q441866): Difference between revisions

@@ Property / author @@
-Marcin Kaminski
@@ Property / author: Marcin Kaminski / rank @@
-Normal rank
@@ Property / author @@
+Marcin Kaminski
@@ Property / author: Marcin Kaminski / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C69
@@ Property / Mathematics Subject Classification ID: 05C69 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C17
@@ Property / Mathematics Subject Classification ID: 05C17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6064148
@@ Property / zbMATH DE Number: 6064148 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+reconfiguration
@@ Property / zbMATH Keywords: reconfiguration / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+independent set
@@ Property / zbMATH Keywords: independent set / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+perfect graphs
@@ Property / zbMATH Keywords: perfect graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+cographs
@@ Property / zbMATH Keywords: cographs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+even-hole-free graphs
@@ Property / zbMATH Keywords: even-hole-free graphs / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.03.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2145799305
@@ Property / OpenAlex ID: W2145799305 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+Normal rank
@@ Property / cites work @@
+Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
+Normal rank
@@ Property / cites work @@
+Connectedness of the graph of vertex-colourings
@@ Property / cites work: Connectedness of the graph of vertex-colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3104271
@@ Property / cites work: Q3104271 / rank @@
+Normal rank
@@ Property / cites work @@
+Mixing 3-colourings in bipartite graphs
@@ Property / cites work: Mixing 3-colourings in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Even-hole-free graphs part II: Recognition algorithm
+Normal rank
@@ Property / cites work @@
+Even-hole-free graphs part I: Decomposition theorem
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
+Normal rank
@@ Property / cites work @@
+PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
+Normal rank
@@ Property / cites work @@
+On the complexity of reconfiguration problems
@@ Property / cites work: On the complexity of reconfiguration problems / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguration of List Edge-Colorings in a Graph
@@ Property / cites work: Reconfiguration of List Edge-Colorings in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths between shortest paths
@@ Property / cites work: Shortest paths between shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Paths between Shortest Paths and Independent Sets
+Normal rank
@@ Property / cites work @@
+Normal hypergraphs and the perfect graph conjecture
+Normal rank
@@ Property / cites work @@
+A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:441866