Pages that link to "Item:Q3440266"
From MaRDI portal
The following pages link to A Linear-Time Algorithm for Finding a Maximal Planar Subgraph (Q3440266):
Displaying 6 items.
- A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks (Q987811) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Edge-orders (Q1741850) (← links)
- The spanning maximal planar subgraph problem for some classes of complete 4-partite graphs (Q2079986) (← links)
- Mondshein Sequences (a.k.a. (2,1)-Orders) (Q2832896) (← links)
- An effective crossing minimisation heuristic based on star insertion (Q3121515) (← links)
