Polynomial time algorithms for the min cut problem on degree restricted trees

Authors:
Moon-Jung Chung;Fillia Makedon;Ivan H. Sudborough;Jonathan Turner
Affiliations:
Rensselaer Polytechnic Institute, Troy, NY;Illinois Institute of Technology, Chicago, IL;Northwestern Univ., Evanston, IL;Bell Laboratories, Murray Hill, NJ
Venue:
SIAM Journal on Computing
Year:
1985

Citing 0
Cited 8

The complexity of searching a graph

Journal of the ACM (JACM)
Computing Optimal Linear Layouts of Trees in Linear Time

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time

Journal of Algorithms
Cutwidth I: a linear time fixed parameter algorithm

Journal of Algorithms
Cutwidth II: algorithms for partial w-trees of bounded degree

Journal of Algorithms
Cutwidth I: A linear time fixed parameter algorithm

Journal of Algorithms
Cutwidth II: Algorithms for partial w-trees of bounded degree

Journal of Algorithms
On cutwidth parameterized by vertex cover

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract