A polynomial algorithm for the min-cut linear arrangement of trees

Authors:
Mihalis Yannakakis
Affiliations:
AT&T Bell Laboratories, Murray Hill, NJ
Venue:
Journal of the ACM (JACM)
Year:
1985

Citing 4
Cited 21

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing Width in Linear Layouts

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Optimal tree layout (Preliminary Version)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Automatic layout of low-cost quick-turnaround random-logic custom LSI devices

DAC '76 Proceedings of the 13th Design Automation Conference

The complexity of searching a graph

Journal of the ACM (JACM)
An exact solution to simultaneous technology mapping and linear placement problem

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Cut as a querying unit for WWW, Netnews, and E-mail

Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
A DSM design flow: putting floorplanning, technology-mapping, and gate-placement together

DAC '98 Proceedings of the 35th annual Design Automation Conference
A survey of graph layout problems

ACM Computing Surveys (CSUR)
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Computing Optimal Linear Layouts of Trees in Linear Time

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
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
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 of Split Graphs, Threshold Graphs, and Proper Interval Graphs

Graph-Theoretic Concepts in Computer Science
Delay-optimal simultaneous technology mapping and placement with applications to timing optimization

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Cutwidth I: A linear time fixed parameter algorithm

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

Journal of Algorithms
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
Distance constrained labelings of graphs of bounded treewidth

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On cutwidth parameterized by vertex cover

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Branch and bound for the cutwidth minimization problem

Computers and Operations Research
A branch-and-bound algorithm for the minimum cut linear arrangement problem

Journal of Combinatorial Optimization
Variable Formulation Search for the Cutwidth Minimization Problem

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm is presented that finds a min-cut linear arrangement of a tree in O(n log n) time. An extension of the algorithm determines the number of pebbles needed to play the black and white pebble game on a tree.