JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/10303

Title: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Authors: Okamoto, Yoshio
Otachi, Yota
Uehara, Ryuhei
Uno, Takeaki
Keywords: Spanning tree congestion
computational complexity
exponential time algorithm
Issue Date: 2011-10
Publisher: Journal of Graph Algorithms and Applications
Magazine name: Journal of Graph Algorithms and Applications
Volume: 15
Number: 6
Start page: 727
End page: 751
Abstract: Spanning tree congestion is a relatively new graph parameter, which has been studied intensively. This paper studies the complexity of the problem to determine the spanning tree congestion for non-sparse graph classes, while it was investigated for some sparse graph classes before. We prove that the problem is NP-hard even for chain graphs and split graphs. To cope with the hardness of the problem, we present a fast (exponentialtime) exact algorithm that runs in O^*(2^n) time, where n denotes the number of vertices. Additionally, we present simple combinatorial lemmas, which yield a constant-factor approximation algorithm for cographs, and a linear-time algorithm for chordal cographs.
Rights: Copyright (C) 2011 Journal of Graph Algorithms and Applications. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, and Takeaki Uno, Journal of Graph Algorithms and Applications, 15(6), 2011, 727-751.
URI: http://hdl.handle.net/10119/10303
Material Type: publisher
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
17641.pdf336KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology