Deciding whether graph \(G\) has page number one is in NC (Q1195855): Difference between revisions

@@ Property / cites work @@
+A simple parallel tree contraction algorithm
@@ Property / cites work: A simple parallel tree contraction algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+The book thickness of a graph
@@ Property / cites work: The book thickness of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
+Normal rank
@@ Property / cites work @@
+Topology of series-parallel networks
@@ Property / cites work: Topology of series-parallel networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992991
@@ Property / cites work: Q3992991 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for series parallel graphs
+Normal rank
@@ Property / cites work @@
+Dividing a Graph into Triconnected Components
@@ Property / cites work: Dividing a Graph into Triconnected Components / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for the domination number of a series-parallel graph
+Normal rank
@@ Property / cites work @@
+Embedding planar graphs in four pages
@@ Property / cites work: Embedding planar graphs in four pages / rank @@
+Normal rank