Abstract
The bisection problem is to split a graph into two equal sized sets of vertices s.t. the number of edges between vertices of different sets is minimal. Natural extensions are to split the graph in more then two sets and allow weights on the edges. This kind of problems will be defined as embedding problems from graphs into a host graphs H. So structured problems will be called H-embeddings.
Measures related to the mincut linear arrangement and optimal linear arrangement will be defined in terms of H-embeddings. Here we show that these problems can be solved in polynomial time for treewidth restricted graphs. These measures will be generalized on edge weighted graphs. So we get that the first can be solved (only) in pseudo polynomial time, while the second problem can be solved in polynomial time.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arnborg, J. Lagergren, and D. Seese. Problems easy for tree-decomposable graphs. In T. Lepistö and A. Salomaa, editors, Proceedings of ICALP'88, pages 38–51. Springer Verlag, 1988.
T.N. Bui, S. Chaudhuri, F.T. Leighton, and M. Sipser. Graph bisection algorithms with good average case behavior. Combinatorica, 7(2):171–191, 1987.
M.W. Bern, E.L. Lawler, and A.L. Wong. Linear-time computation of optimal subgraphs of decomposable graphs. Journal of Algorithms, 8:216–235, 1987.
H.L. Bodlaender. Dynamic programming on graphs with bounded treewidth. In Lecture Notes in Computer Science, pages 38–51. ICALP 88, Springer Verlag, 1988.
B. Courcelle. The monadic second-order theory of graphs I: Recognizable sets of finite graphs. Research report, submitted for publication, Université Bordeaux, 1986–88.
C.M. Fiduccia and R.M. Mattheyses. A linear time heuristic for improving network partitions. In Proceedings of the 19th Design Automation Conference, pages 175–181, 1982.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, 1979.
E.T. Gurari and I.H. Sudborough. Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem. Journal of Algorithms, 5:531–546, 1984.
B.K. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal, 49(2):291–307, 1970.
B. Monien and I.H. Sudborough. Min-cut is NP-Complete for edge weighted trees. Theoretical Computer Science, 58:209–229, 1988.
N. Robertson and P. Seymour. Graph minors. II. algorithmic aspects of treewidth. Journal of Algorithms, 7:309–322, 1986.
P.R. Suaris and G. Kedem. Quadrisection: A new apporach to standard cell layout. In Digest of Technical Papers, pages 474–477. Int. Conf. on Computer-Aided Design, Nov. 1987.
E. Wanke and M. Wiegers. Undeciability of the bandwidth problem on certain linear graph languages. Information Processing Letters, 33(4):193–197, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiegers, M. (1990). The k-section of treewidth restricted graphs. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029652
Download citation
DOI: https://doi.org/10.1007/BFb0029652
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52953-8
Online ISBN: 978-3-540-47185-1
eBook Packages: Springer Book Archive