Pages that link to "Item:Q3158532"
From MaRDI portal
The following pages link to Fully dynamic planarity testing with applications (Q3158532):
Displaying 7 items.
- Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time (Q4645175) (← links)
- A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415) (← links)
- (Q5111734) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
