scientific article

zbMath0514.94025MaRDI QIDQ3661483

F. S. Makedon, Ivan Hal Sudborough

Publication date: 1983

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

zbMATH Keywords

dynamic programming algorithmcutwidth of a graph Gundirected graph G

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items

Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs ⋮ On embedding graphs in trees ⋮ Min Cut is NP-complete for edge weighted trees ⋮ Polynomial-time self-reducibility: theoretical motivations and practical results^∗ ⋮ A branch-and-bound algorithm for the minimum cut linear arrangement problem ⋮ Graph layout problems ⋮ Visibility-based pursuit-evasion in a polygonal environment ⋮ Narrowness, pathwidth, and their application in natural language processing ⋮ Graph parameters measuring neighbourhoods in graphs-bounds and applications ⋮ Approximation algorithms for the bandwidth minimization problem for a large class of trees ⋮ Four-searchable biconnected outerplanar graphs ⋮ A polynomial algorithm for recognizing bounded cutwidth in hypergraphs ⋮ Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time