Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

Journal of Algorithms

Volumn 11, Issue 4, 1990, Pages 631-643

  Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001078822     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(90)90013-5     Document Type: Article

References (23)

1. Efficient algorithms for combinatorial problems on graphs with bounded decomposability—A survey
2. Complexity of finding embeddings in a k-tree
3. Problems easy for tree-decomposable graphs (extended abstract)
4. Characterization and recognition of partial 3-trees
5. Linear time algorithms for NP-hard problems restricted to partial k-trees
6. Classes of graphs with Bounded Treewidth
7. Dynamic Programming Algorithms on Graphs with Bounded Treewidth
8. Improved Self-reduction Algorithms for Graphs with Bounded Treewidth
9. NC-algorithms for graphs with small treewidth
10. Fast parallel algorithms for tree decomposition and parsing partial k-trees
11. The monadic second order logic of graphs. I. Recognizable sets of finite graphs
12. The NP-completeness of edge-coloring
13. 5/2 algorithm for maximum matching in bipartite graphs
14. The NP-completeness column: An ongoing guide
15. On the complexity of finding iso- and other morphisms for partial k-trees
16. Graph minors. III. Planar tree-width
17. Linear-Time Algorithms for NP-Complete Problems Restricted to Partial k-Trees
18. Die Baumweite von Graphen als ein Maß für die Kompliziertheit algorithmischer Probleme
19. NP-complete problems on some tree-structured graphs: A review
20. Graph algorithms
21. Linear Algorithms on k-Terminal Graphs