Polynomial time algorithms for the MIN CUT problem on degree restricted trees

Authors:
Moon-Jung Chung;Fillia Makedon;Ivan Hal Sudborough;Jonathan Turner
Affiliations:
-;-;-;-
Venue:
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Year:
1982

Citing 0
Cited 5

A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs

Graph-Theoretic Concepts in Computer Science
Computing the cutwidth of bipartite permutation graphs in linear time

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Branch and bound for the cutwidth minimization problem

Computers and Operations Research
Variable Formulation Search for the Cutwidth Minimization Problem

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Polynomial algorithms are described that solve the MIN CUT LINEAR ARRANGEMENT problem on degree restricted trees. For example, the cutwidth or folding number of an arbitrary degree d tree can be found in O(n(logn)d-2) steps. This also yields an algorithm for determining the black/white pebble demand of degree three trees. A forbidden subgraph characterization is given for degree three trees having cutwidth k. This yields an interesting corollary: for degree three trees, cutwidth is identical to search number.