Pages that link to "Item:Q1920420"
From MaRDI portal
The following pages link to Maximum planar subgraphs and nice embeddings: Practical layout tools (Q1920420):
Displaying 18 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- A genetic algorithm for determining the thickness of a graph (Q1602541) (← links)
- An experimental comparison of four graph drawing algorithms. (Q2482890) (← links)
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY (Q2708043) (← links)
- A Note on the Practicality of Maximal Planar Subgraph Algorithms (Q2961528) (← links)
- Computing Maximum C-Planar Subgraphs (Q3611845) (← links)
- A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415) (← links)
- (Q5009576) (← links)
- (Q5090466) (← links)
- (Q5140734) (← links)
- A Linear-Time Algorithm for Finding Induced Planar Subgraphs (Q5140735) (← links)
- Efficient Extraction of Multiple Kuratowski Subdivisions (Q5452219) (← links)
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph (Q6558687) (← links)
