The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (Q3507648): Difference between revisions

@@ Property / DOI @@
-.1002/net.20214
@@ Property / DOI: 10.1002/net.20214 / rank @@
-Normal rank
@@ Property / cites work @@
+Restricted Mesh Simplification Using Edge Contractions
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchy of surface models and irreducible triangulations.
+Normal rank
@@ Property / cites work @@
+Q4474204
@@ Property / cites work: Q4474204 / rank @@
+Normal rank
@@ Property / cites work @@
+Contraction theorems in Hamiltonian graph theory
@@ Property / cites work: Contraction theorems in Hamiltonian graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
+Normal rank
@@ Property / cites work @@
+The computational complexity of graph contractions II: Two tough polynomially solvable cases
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the NP-hardness of edge-deletion and -contraction problems
+Normal rank
@@ Property / DOI @@
+.1002/NET.20214
@@ Property / DOI: 10.1002/NET.20214 / rank @@
+Normal rank