Pages that link to "Item:Q2817665"
From MaRDI portal
The following pages link to Alpha-algorithms for incremental planarity testing (extended abstract) (Q2817665):
Displaying 10 items.
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Graph stories in small area (Q2206885) (← links)
- An analysis of heuristics for graph planarization (Q4354090) (← links)
- A linear algorithm for the maximal planar subgraph problem (Q5057449) (← links)
- Maintenance of triconnected components of graphs (Q5204330) (← links)
- Certificates and fast algorithms for biconnectivity in fully-dynamic graphs (Q6102299) (← links)
- Small Point-Sets Supporting Graph Stories (Q6141788) (← links)
- A linear time algorithm for finding maximal planar subgraphs (Q6487983) (← links)