A linear-time algorithm for testing full outer-2-planarity (Q1727743): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2018.08.018
@@ Property / DOI: 10.1016/j.dam.2018.08.018 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2018.08.018
+Normal rank
@@ Property / OpenAlex ID @@
+W2898765768
@@ Property / OpenAlex ID: W2898765768 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum number of edges in topological graphs with no four pairwise crossing edges
+Normal rank
@@ Property / cites work @@
+Quasi-planar graphs have a linear number of edges
@@ Property / cites work: Quasi-planar graphs have a linear number of edges / rank @@
+Normal rank
@@ Property / cites work @@
+The Straight-Line RAC Drawing Problem is NP-Hard
@@ Property / cites work: The Straight-Line RAC Drawing Problem is NP-Hard / 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 @@
+On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
+Normal rank
@@ Property / cites work @@
+Fan-planarity: properties and complexity
@@ Property / cites work: Fan-planarity: properties and complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the Number of Edges of Fan-Crossing Free Graphs
+Normal rank
@@ Property / cites work @@
+On-Line Planarity Testing
@@ Property / cites work: On-Line Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing graphs with right angle crossings
@@ Property / cites work: Drawing graphs with right angle crossings / rank @@
+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 @@
+Straight-Line Drawability of a Planar Graph Plus an Edge
+Normal rank
@@ Property / cites work @@
+Q3699704
@@ Property / cites work: Q3699704 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5786239
@@ Property / cites work: Q5786239 / rank @@
+Normal rank
@@ Property / cites work @@
+The Number of Edges in $k$-Quasi-planar Graphs
@@ Property / cites work: The Number of Edges in $k$-Quasi-planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+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 @@
+Testing Full Outer-2-planarity in Linear Time
@@ Property / cites work: Testing Full Outer-2-planarity in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / 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 @@
+New bounds on the maximum number of edges in \(k\)-quasi-planar graphs
+Normal rank
@@ Property / cites work @@
+Rectilinear drawings of graphs
@@ Property / cites work: Rectilinear drawings of graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2018.08.018
@@ Property / DOI: 10.1016/J.DAM.2018.08.018 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1727743