Pages that link to "Item:Q3378497"
From MaRDI portal
The following pages link to On the Cutting Edge: Simplified O(n) Planarity by Edge Addition (Q3378497):
Displayed 44 items.
- On protein structure alignment under distance constraint (Q553356) (← links)
- Invariants of graph drawings in the plane (Q778122) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- A large set of torus obstructions and how they were discovered (Q1700776) (← links)
- On the \(k\)-planar local crossing number (Q1727762) (← links)
- Testing gap \(k\)-planarity is NP-complete (Q2032139) (← links)
- House of graphs 2.0: a database of interesting graphs and more (Q2104929) (← links)
- Switching 3-edge-colorings of cubic graphs (Q2144509) (← links)
- Treetopes and their graphs (Q2197683) (← links)
- Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
- Some results on point visibility graphs (Q2339447) (← links)
- Regularity and planarity of token graphs (Q2364080) (← links)
- Characterizing 2-crossing-critical graphs (Q2635081) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- \((k,p)\)-planarity: a relaxation of hybrid planarity (Q2664946) (← links)
- Recursive computation of Feynman periods (Q2678223) (← links)
- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem (Q2819516) (← links)
- Communicability Angle and the Spatial Efficiency of Networks (Q2832109) (← links)
- REOPTIMIZATION UNDER VERTEX INSERTION: MAX P<sub>k</sub>-FREE SUBGRAPH AND MAX PLANAR SUBGRAPH (Q2846477) (← links)
- A Note on the Practicality of Maximal Planar Subgraph Algorithms (Q2961528) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs (Q3541081) (← links)
- A New Approach to Exact Crossing Minimization (Q3541091) (← links)
- Improved bounds for hypohamiltonian graphs (Q4604513) (← links)
- Verification of the Jones unknot conjecture up to 22 crossings (Q4634898) (← links)
- An algorithm for an 𝓁<sup>2</sup>-homological test for the planarity of a graph (Q4956221) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- $$\textit{\textbf{k}}$$-Planar Graphs (Q5001659) (← links)
- Revising the Fellows-Kaschube $K_{3,3}$ Search (Q5084691) (← links)
- The Optimal Packing of Eight Points in the Real Projective Plane (Q5094481) (← links)
- (Q5140734) (← links)
- A Linear-Time Algorithm for Finding Induced Planar Subgraphs (Q5140735) (← links)
- Graphs with few hamiltonian cycles (Q5207451) (← links)
- Planarity Algorithms via PQ-Trees (Extended Abstract) (Q5300998) (← links)
- Cyclic Level Planarity Testing and Embedding (Q5452210) (← links)
- Efficient Extraction of Multiple Kuratowski Subdivisions (Q5452219) (← links)
- Tractable minor-free generalization of planar zero-field Ising models (Q5857455) (← links)
- Classical vs quantum satisfiability in linear constraint systems modulo an integer (Q5870684) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- Acyclic 3-coloring of generalized Petersen graphs (Q5963660) (← links)
- An annotated review on graph drawing and its applications (Q6152611) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)