Pages that link to "Item:Q6487983"
From MaRDI portal
The following pages link to A linear time algorithm for finding maximal planar subgraphs (Q6487983):
Displaying 12 items.
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
- Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph (Q764406) (← links)
- An algorithm of graph planarity testing and cross minimization (Q1049731) (← links)
- A new approach to the linearity of testing planarity of graphs (Q1117237) (← links)
- A new approximation algorithm for finding heavy planar subgraphs (Q1400892) (← links)
- Connectivity of planar graphs (Q2755060) (← links)
- A subset spanner for Planar graphs, with application to subset TSP (Q2931435) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- (Q4875164) (← links)
- A linear algorithm for the maximal planar subgraph problem (Q5057449) (← links)
- A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications (Q5140773) (← links)
- Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time (Q5236218) (← links)