Pages that link to "Item:Q3869371"

The following pages link to A Separator Theorem for Planar Graphs (Q3869371):

Displaying 8 items.

• Decomposition by clique separators (Q1062072) (← links)
• Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
• Large planar graphs with given diameter and maximum degree (Q1897359) (← links)
• Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
• The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
• Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
• Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
• Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)