A linear-time algorithm for testing outer-1-planarity (Q494794): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 05C10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6477666
@@ Property / zbMATH DE Number: 6477666 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph drawing
@@ Property / zbMATH Keywords: graph drawing / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+-planar graphs
@@ Property / zbMATH Keywords: 1-planar graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+outer 1-planar graphs
@@ Property / zbMATH Keywords: outer 1-planar graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+-planarity
@@ Property / zbMATH Keywords: 1-planarity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+-planar embedding
@@ Property / zbMATH Keywords: 1-planar embedding / rank @@
+Normal rank
@@ 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.1007/s00453-014-9890-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2159869336
@@ Property / OpenAlex ID: W2159869336 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q62042391
@@ Property / Wikidata QID: Q62042391 / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing outerplanar graphs using three edge lengths
+Normal rank
@@ Property / cites work @@
+Recognizing Outer 1-Planar Graphs in Linear Time
@@ Property / cites work: Recognizing Outer 1-Planar Graphs in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of 1-Planarity
@@ Property / cites work: Parameterized Complexity of 1-Planarity / 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 @@
+Q3679212
@@ Property / cites work: Q3679212 / rank @@
+Normal rank
@@ Property / cites work @@
+Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line maintenance of triconnected components with SPQR-trees
+Normal rank
@@ Property / cites work @@
+h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
+Normal rank
@@ Property / cites work @@
+EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
+Normal rank
@@ Property / cites work @@
+Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
+Normal rank
@@ Property / cites work @@
+Q3699704
@@ Property / cites work: Q3699704 / rank @@
+Normal rank
@@ Property / cites work @@
+The structure of 1-planar graphs
@@ Property / cites work: The structure of 1-planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
+Normal rank
@@ Property / cites work @@
+Algorithms for graphs embeddable with few crossings per edge
+Normal rank
@@ Property / cites work @@
+Q4472293
@@ Property / cites work: Q4472293 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Testing Outer-1-Planarity
+Normal rank
@@ Property / cites work @@
+Fáry’s Theorem for 1-Planar Graphs
@@ Property / cites work: Fáry’s Theorem for 1-Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned 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 @@
+Graph Drawings with One Bend and Few Slopes
@@ Property / cites work: Graph Drawings with One Bend and Few Slopes / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
+Normal rank
@@ Property / cites work @@
+Graphs drawn with few crossings per edge
@@ Property / cites work: Graphs drawn with few crossings per edge / rank @@
+Normal rank
@@ Property / cites work @@
+Ein Sechsfarbenproblem auf der Kugel
@@ Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal 1-planar graphs which triangulate other surfaces
+Normal rank
@@ Property / cites work @@
+Re-embeddings of Maximum 1-Planar Graphs
@@ Property / cites work: Re-embeddings of Maximum 1-Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Rectilinear drawings of graphs
@@ Property / cites work: Rectilinear drawings of graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:494794