Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240): Difference between revisions

@@ 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.09.025
+Normal rank
@@ Property / OpenAlex ID @@
+W2076850117
@@ Property / OpenAlex ID: W2076850117 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization of LR(k) parsers
@@ Property / cites work: Optimization of LR(k) parsers / rank @@
+Normal rank
@@ Property / cites work @@
+Dominators in Linear Time
@@ Property / cites work: Dominators in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508365
@@ Property / cites work: Q4508365 / rank @@
+Normal rank
@@ Property / cites work @@
+Output-sensitive reporting of disjoint paths
@@ Property / cites work: Output-sensitive reporting of disjoint paths / rank @@
+Normal rank
@@ Property / cites work @@
+Maintaining the classes of 4-edge-connectivity in a graph on-line
+Normal rank
@@ Property / cites work @@
+Sparsification—a technique for speeding up dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Q2921698
@@ Property / cites work: Q2921698 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominators, Directed Bipolar Orders, and Independent Spanning Trees
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+The disjoint paths problem in quadratic time
@@ Property / cites work: The disjoint paths problem in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+Q3914448
@@ Property / cites work: Q3914448 / rank @@
+Normal rank
@@ Property / cites work @@
+AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH
+Normal rank
@@ Property / cites work @@
+Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
+Normal rank
@@ Property / cites work @@
+Q4273851
@@ Property / cites work: Q4273851 / rank @@
+Normal rank
@@ Property / cites work @@
+Rooted routing in the plane
@@ Property / cites work: Rooted routing in the plane / rank @@
+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 @@
+Q4280137
@@ Property / cites work: Q4280137 / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs
@@ Property / cites work: Disjoint paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Solution to the Undirected Two Paths Problem
+Normal rank
@@ Property / cites work @@
+A quick method for finding shortest pairs of disjoint paths
+Normal rank
@@ Property / cites work @@
+Worst-case Analysis of Set Union Algorithms
@@ Property / cites work: Worst-case Analysis of Set Union Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the 2-disjoint paths problem in nearly linear time
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for the 2-Vertex Disjoint Paths Problem
+Normal rank
@@ Property / cites work @@
+-linked graphs
@@ Property / cites work: 2-linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The 2-linkage problem for acyclic digraphs
@@ Property / cites work: The 2-linkage problem for acyclic digraphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1929240