Pages that link to "Item:Q4277534"

The following pages link to An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem (Q4277534):

Displayed 11 items.

• A branch-and-cut approach to the crossing number problem (Q951113) ‎ (← links)
• A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks (Q987811) ‎ (← links)
• Non-planar core reduction of graphs (Q1011763) ‎ (← links)
• A genetic algorithm for determining the thickness of a graph (Q1602541) ‎ (← links)
• Maximum planar subgraphs and nice embeddings: Practical layout tools (Q1920420) ‎ (← links)
• Gap strings and spanning forests for bridge graphs of biconnected graphs (Q1923606) ‎ (← links)
• A new planarity test (Q1960413) ‎ (← links)
• A new neural network algorithm for planarization problems (Q2250738) ‎ (← links)
• A simulated annealing algorithm for determining the thickness of a graph (Q2568255) ‎ (← links)
• An analysis of heuristics for graph planarization (Q4354090) ‎ (← links)
• Branch-and-bound techniques for the maximum planar subgraph problem^∗ (Q4844576) ‎ (← links)