Pages that link to "Item:Q4285458"
From MaRDI portal
The following pages link to An efficient graph planarization two‐phase heuristic (Q4285458):
Displaying 10 items.
- Non-planar core reduction of graphs (Q1011763) (← links)
- On finding a biconnected spanning planar subgraph with applications to the facilities layout problem (Q1278276) (← links)
- A heuristic approach towards drawings of graphs with high crossing resolution (Q1725757) (← links)
- Maximum planar subgraphs and nice embeddings: Practical layout tools (Q1920420) (← links)
- A new neural network algorithm for planarization problems (Q2250738) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- An analysis of heuristics for graph planarization (Q4354090) (← links)
- (Q4422291) (← links)
- A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415) (← links)
- Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> (Q4844576) (← links)