Path-contractions, edge deletions and connectivity preservation (Q1713475): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2018.10.001
@@ Property / DOI: 10.1016/j.jcss.2018.10.001 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963841226
@@ Property / OpenAlex ID: W2963841226 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06622
@@ Property / arXiv ID: 1704.06622 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum spanning strong subdigraph problem is fixed parameter tractable
+Normal rank
@@ Property / cites work @@
+Q3085455
@@ Property / cites work: Q3085455 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
+Normal rank
@@ Property / cites work @@
+Kernelization and complexity results for connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms to Preserve Connectivity
@@ Property / cites work: Parameterized Algorithms to Preserve Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4608076
@@ Property / cites work: Q4608076 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-connectivity augmentation problems
@@ Property / cites work: Edge-connectivity augmentation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Minimal edge-coverings of pairs of sets
@@ Property / cites work: Minimal edge-coverings of pairs of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Undirected Node-Connectivity by One
@@ Property / cites work: Augmenting Undirected Node-Connectivity by One / rank @@
+Normal rank
@@ Property / cites work @@
+Reducing CMSO model checking to highly connected graphs
+Normal rank
@@ Property / cites work @@
+Q4967164
@@ Property / cites work: Q4967164 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Network Flow and Testing Graph Connectivity
@@ Property / cites work: Network Flow and Testing Graph Connectivity / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q128987347
@@ Property / Wikidata QID: Q128987347 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2018.10.001
@@ Property / DOI: 10.1016/J.JCSS.2018.10.001 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1713475