scientific article
From MaRDI portal
Publication:3725545
zbMath0594.68042MaRDI QIDQ3725545
Burkhard Monien, Ivan Hal Sudborough
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs ⋮ On the complexity of loading shallow neural networks ⋮ Linear time algorithms for NP-hard problems restricted to partial k- trees ⋮ Parallel algorithms for the minimum cut and the minimum length tree layout problems ⋮ Efficient parallel algorithms for some tree layout problems ⋮ A variation on the min cut linear arrangement problem ⋮ Minimal cutwidth linear arrangements of abelian Cayley graphs ⋮ Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time ⋮ Bounds on mincut for Cayley graphs over Abelian groups ⋮ Tree-width, path-width, and cutwidth ⋮ ``Global graph problems tend to be intractable
