Complexity of path-forming games
- 15 March 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 110 (1), 215-245
- https://doi.org/10.1016/0304-3975(93)90357-y
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Algorithms finding tree-decompositions of graphsJournal of Algorithms, 1991
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-treesJournal of Algorithms, 1990
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphsJournal of Algorithms, 1987
- Linear-time computation of optimal subgraphs of decomposable graphsJournal of Algorithms, 1987
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1983
- Computing a perfect strategy for n × n chess requires time exponential in nJournal of Combinatorial Theory, Series A, 1981