Log-Space Algorithms for Paths and Matchings in k-Trees

Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 (Jakoby and Tantau in Proceedings of FSTTCS’07: The 27th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 216–227, 2007). 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 matching (decision version), and if so, finding a perfect matching (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, as shown in Datta et al. (Theory Comput. Syst. 47:737–757, 2010).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 the divide-and-conquer approach in log-space, along with some ideas from Jakoby and Tantau (Proceedings of FSTTCS’07: The 27th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 216–227, 2007) and Limaye et al. (Theory Comput. Syst. 46(3):499–522, 2010).

[1]  Eric Allender,et al.  Planar and Grid Graph Reachability Problems , 2009, Theory of Computing Systems.

[2]  R. Sridhar,et al.  Fast Parallel Reordering and Isomorphism Testing of k -Trees , 2001, Algorithmica.

[3]  Burchard von Braunmühl,et al.  Input-Driven Languages are Recognized in log n Space , 1983, FCT.

[4]  Meena Mahajan,et al.  On the Bipartite Unique Perfect Matching Problem , 2006, ICALP.

[5]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[6]  Meena Mahajan,et al.  Longest Paths in Planar DAGs in Unambiguous Log-Space , 2010, Chic. J. Theor. Comput. Sci..

[7]  Thomas Thierauf,et al.  Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space , 2009, FCT.

[8]  Meena Mahajan,et al.  Arithmetizing Classes Around NC 1 and L , 2007, STACS.

[9]  Andrew Chiu,et al.  Division in logspace-uniform NC1 , 2001, RAIRO Theor. Informatics Appl..

[10]  D. Corneil,et al.  Isomorphism Testing in Hookup Classes , 1982 .

[11]  Laurent Lyaudet,et al.  On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices , 2007, ISAAC.

[12]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[13]  Mark Braverman,et al.  Parity Problems in Planar Graphs , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[14]  F. Harary,et al.  On acyclic simplicial complexes , 1968 .

[15]  Meena Mahajan,et al.  Arithmetizing Classes Around NC\textsf{NC} 1 and L\textsf{L}. , 2010 .

[16]  Meena Mahajan,et al.  Arithmetizing Classes Around [FORMULA]1 and [FORMULA] , 2010 .

[17]  Eric Allender.  Making computation count: arithmetic circuits in the nineties , 1997, SIGA.

[18]  Vikraman Arvind,et al.  The Space Complexity of k -Tree Isomorphism , 2007, ISAAC.

[19]  Egon Wanke.  Bounded Tree-Width and LOGCFL , 1993, WG.

[20]  Meena Mahajan,et al.  Planarity, Determinants, Permanents, and (Unique) Matchings , 2010, TOCT.

[21]  Eric Allender,et al.  Uniform constant-depth threshold circuits for division and iterated multiplication , 2002, J. Comput. Syst. Sci..

[22]  Kousha Etessami,et al.  Counting quantifiers, successor relations, and logarithmic space , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[23]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[24]  B. Mohar,et al.  Graph Minors , 2009 .

[25]  Samuel R. Buss,et al.  An Optimal Parallel Algorithm for Formula Evaluation , 1992, SIAM J. Comput..

[26]  Naomi Nishimura,et al.  Embeddings of k-Connected Graphs of Pathwidth k , 2000, SWAT.

[27]  Johannes Köbler,et al.  The Isomorphism Problem for k-Trees Is Complete for Logspace , 2009, MFCS.

[28]  Sridhar Hannenhalli,et al.  Efficient algorithms for computing matching and chromatic polynomials on series-parallel graphs , 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.

[29]  Eric Allender,et al.  Making nondeterminism unambiguous , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[30]  Michael Ben-Or,et al.  Computing Algebraic Formulas Using a Constant Number of Registers , 1992, SIAM J. Comput..

[31]  Andreas Jakoby,et al.  Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs , 2007, FSTTCS.

[32]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[33]  Andreas Jakoby,et al.  Logspace Versions of the Theorems of Bodlaender and Courcelle , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[34]  Raghav Kulkarni,et al.  Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs , 2009, Theory of Computing Systems.

[35]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[36]  Meena Mahajan,et al.  Arithmetizing Classes Around $\textsf{NC}$1 and $\textsf{L}$ , 2009, Theory of Computing Systems.