Starting with nondeterminism: The systematic derivation of linear-time graph layout algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 239-248

  Bodlaender, Hans L ^a   Fellows, Michael R ^b   Thilikos, Dimitrios M ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Algorithm design methodology; Algorithms and data structures; Finite state automata; Graph algorithms; Graph layout problems

Indexed keywords

CLUSTERING ALGORITHMS; FINITE AUTOMATA; PARAMETER ESTIMATION;

ALGORITHM DESIGN; ALGORITHMS AND DATA STRUCTURES; GRAPH ALGORITHMS; GRAPH LAYOUT ALGORITHMS; GRAPH LAYOUT PROBLEMS; LINEAR-TIME ALGORITHMS; NONDETERMINISTIC ALGORITHMS; TECHNICAL DETAILS;

ALGORITHMS;

EID: 21144433317     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_18     Document Type: Article

References (16)

1. K. R. Abrahamson and M. R. Fellows. Finite automata, bounded treewidth and well-quasiordering. In Proc. of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics vol. 141, pp. 539-564. American Mathematical Society, 1993.
2. H. Bodlaender, J. Gustedt, and J. A. Telle. Linear-time register allocation for a fixed number of registers. In Proc. of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 574-583. ACM, 1998.
3. H. L. Bodlaender. Treewidth: Algorithmic techniques and results. In Proc. 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS'97, pp. 19-36. LNCS, vol. 1295, Springer-Verlag, 1997.
4. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sc., 209:1-45, 1998.
5. H. L. Bodlaender, M. R. Fellows, and P. A. Evans. Finite-state computability of annotations of strings and trees. In Proc. Conference on Pattern Matching, pp. 384-391, 1996.
6. H. L. Bodlaender, M. R. Fellows, and D. M. Thilikos. Derivation of algorithms for cutwidth and related graph layout problems. Technical Report UU-CS-2002-032, Inst. of Inform. and Comp. Sc., Utrecht Univ., Utrecht, the Netherlands, 2002.
7. H. L. Bodlaender and T. Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms, 21:358-402, 1996.
8. H. L. Bodlaender and D. M. Thilikos. Constructive linear time algorithms for branchwidth. In Proc. 24th International Colloquium on Automata, Languages, and Programming, pp. 627-637. LNCS, vol. 1256, Springer-Verlag, 1997.
9. J. Chen, D. K. Friesen, W. Jia, and I. Kanj. Using nondeterminism to design deterministic algorithms. In Proc. 21st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2001, pp. 120-131. LNCS, vol. 2245, Springer-Verlag, 2001.
10. M.-H. Chen and S.-L. Lee. Linear time algorithms for k-cutwidth problem. In Proc. Third International Symposium on Algorithms and Computation, ISAAC'92, pp. 21-30. LNCS, vol. 650, Springer-Verlag, 1992.
11. R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput., 24:873-921, 1995.
12. N. G. Kinnersley and W. M. Kinnersley. Tree automata for cutwidth recognition. Congressus Numerantium, 104:129-142, 1994.
13. J. Lagergren and S. Arnborg. Finding minimal forbidden minors using a finite congruence. In Proc. of the 18th International Colloquium on Automata, Languages and Programming, pp. 532-543. LNCS vol. 510, Springer-Verlag, 1991.
14. B. Monien and I. H. Sudborough. Min cut is NP-complete for edge weighted trees. Theor. Comp. Sc., 58:209-229, 1988.
15. D. M. Thilikos, M. J. Serna, and H. L. Bodlaender. A constructive linear time algorithm for small cutwidth. Technical Report LSI-00-48-R, Departament de Llenguatges i Sistemes Informatics, Univ. Politecnica de Catalunya, Barcelona, Spain, 2000.
16. D. M. Thilikos, M. J. Serna, and H. L. Bodlaender. Constructive linear time algorithms for small cutwidth and carving-width. In Proc. 11th International Symposium on Algorithms And Computation ISAAC '00, pp. 192-203. LNCS vol. 1969, Springer-Verlag, 2000.