scientific article

zbMath1192.05082MaRDI QIDQ3576658

David R. Wood, Bruce A. Reed

Publication date: 30 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0110/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph algorithmminorseparator

Mathematics Subject Classification ID

Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (6)

A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes ⋮ Single source shortest paths in \(H\)-minor free graphs ⋮ On the maximum number of cliques in a graph ⋮ Optimization and Recognition for K 5-minor Free Graphs in Linear Time ⋮ Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation ⋮ A Reduction of the Anticoloring Problem to Connected Graphs

This page was built for publication: