Pages that link to "Item:Q1062924"
From MaRDI portal
The following pages link to Analysis of heuristics for finding a maximum weight planar subgraph (Q1062924):
Displaying 8 items.
- Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- A new approximation algorithm for finding heavy planar subgraphs (Q1400892) (← links)
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem (Q2819516) (← links)
- An analysis of heuristics for graph planarization (Q4354090) (← links)