A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Depth-First Search in General Directed Graphs
+Normal rank
@@ Property / cites work @@
+Q3797233
@@ Property / cites work: Q3797233 / rank @@
+Normal rank
@@ Property / cites work @@
+Trapezoid graphs and their coloring
@@ Property / cites work: Trapezoid graphs and their coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Depth-First Search in $O(\log n)$ Parallel Time
+Normal rank
@@ Property / cites work @@
+On the existence of special depth first search trees
+Normal rank
@@ Property / cites work @@
+Dominations in trapezoid graphs
@@ Property / cites work: Dominations in trapezoid graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
+Normal rank
@@ Property / cites work @@
+On the 2-Chain Subgraph Cover and Related Problems
+Normal rank
@@ Property / cites work @@
+A new algorithm for minimum spanning tree using depth-first-search in an undirected graph
+Normal rank
@@ Property / cites work @@
+A linear-processor algorithm for depth-first search in planar graphs
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(97)00088-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1979383396
@@ Property / OpenAlex ID: W1979383396 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:287118