scientific article; zbMATH DE number 3813518

zbMATH Open0514.94025MaRDI QIDQ3661483FDOQ3661483

Authors F. S. Makedon, I. H. Sudborough 

Publication date 1983

zbMATH Keywords

dynamic programming algorithmcutwidth of a graph Gundirected graph G

Mathematics Subject Classification ID

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

Cited In (13)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661483)