Pages that link to "Item:Q5057449"
From MaRDI portal
The following pages link to A linear algorithm for the maximal planar subgraph problem (Q5057449):
Displaying 7 items.
- Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph (Q764406) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- An algorithm for the characterization of the nonplanarity of a maximal graphical partition (Q1095148) (← links)
- (Q4875164) (← 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)
- A linear time algorithm for finding maximal planar subgraphs (Q6487983) (← links)