Pages that link to "Item:Q5458529"
From MaRDI portal
The following pages link to Optimization and Recognition for K 5-minor Free Graphs in Linear Time (Q5458529):
Displayed 8 items.
- Rooted \(K_4\)-minors (Q396793) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- A model for finding transition-minors (Q2192081) (← links)
- An algorithm for delta-wye reduction of almost-planar graphs (Q2197481) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- Tractable minor-free generalization of planar zero-field Ising models (Q5857455) (← links)