Skip to Main content Skip to Navigation
Conference papers

Log-space Algorithms for Paths and Matchings in k-trees

Abstract : Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [JT07]. However, for graphs of tree-width larger than 2, no bound better than NL is known. In this paper, we improve these bounds for k-trees, where k is a constant. In particular, the main results of our paper are log-space algorithms for reachability in directed k-trees, and for computation of shortest and longest paths in directed acyclic k-trees. Besides the path problems mentioned above, we also consider the problem of deciding whether a k-tree has a perfect macthing (decision version), and if so, finding a perfect match- ing (search version), and prove that these two problems are L-complete. These problems are known to be in P and in RNC for general graphs, and in SPL for planar bipartite graphs [DKR08]. Our results settle the complexity of these problems for the class of k-trees. The results are also applicable for bounded tree-width graphs, when a tree-decomposition is given as input. The technique central to our algorithms is a careful implementation of divide-and-conquer approach in log-space, along with some ideas from [JT07] and [LMR07].
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Publications Loria <>
Submitted on : Wednesday, February 10, 2010 - 4:50:48 PM
Last modification on : Monday, August 19, 2019 - 4:20:06 PM
Long-term archiving on: : Friday, June 18, 2010 - 8:01:35 PM


Files produced by the author(s)


  • HAL Id : inria-00455584, version 1



Bireswar Das, Samir Datta, Prajakta Nimbhorkar. Log-space Algorithms for Paths and Matchings in k-trees. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.215-226. ⟨inria-00455584⟩



Record views


Files downloads