SCOPUS 정보 검색 플랫폼

Volumn 1665, Issue , 1999, Pages 148-154

An improved algorithm for finding tree decompositions of small width

b CNRS (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

INPUT GRAPHS; LINEAR-TIME ALGORITHMS; SUBGRAPHS; TREE DECOMPOSITION; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 84947799712 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-46784-x_15 Document Type: Conference Paper

Times cited : (8)

References (13)

1
- 0000504885
- Easy problems for tree-decomposable graphs
- Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. of Algorithms 12 (1991) 308-340
- (1991) J.Of Algorithms , vol.12 , pp. 308-340
- Arnborg, S.¹ Lagergren, J.² Seese, D.³

2
- 0027699382
- An algebraic theory of graph reduction
- Arnborg, S., Courcelle, B., Proskurowski, A., Seese, D.: An algebraic theory of graph reduction. J. Assoc. Comput. Mach. 40 (1993) 1134-1164
- (1993) J. Assoc. Comput. Mach , vol.40 , pp. 1134-1164
- Arnborg, S.¹ Courcelle, B.² Proskurowski, A.³ Seese, D.⁴

3
- 0000245736
- Complexity of finding embeddings in a k-tree
- Arnborg, S., Corneil, D. G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebra Discrete Methods 8 (1987) 277-284 149
- (1987) SIAM J. Algebra Discrete Methods , vol.8 , pp. 277-284
- Arnborg, S.¹ Corneil, D.G.² Proskurowski, A.³

4
- 0001294529
- A linear-time algorithm for finding tree-decompositions of small treewidth
- Bodlaender, H. L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25:6 (1996) 1305-1317 149, 150, 154
- (1996) SIAM J. Comput , vol.25 , Issue.6 , pp. 1305-1317
- Bodlaender, H.L.¹

5
- 0002981945
- A partial k-arboretum of graphs with bounded treewidth
- Bodlaender, H. L.: A partial k-arboretum of graphs with bounded treewidth. The-oret. Comput. Sci. 209:1-2 (1998) 1-45 148
- (1998) The-Oret. Comput. Sci , vol.209 , Issue.1-2 , pp. 1-45
- Bodlaender, H.L.¹

6
- 0030356420
- Efficient and constructive algorithms for the path- width and treewidth of graphs
- Bodlaender, H. L., Kloks, T.: Efficient and constructive algorithms for the path- width and treewidth of graphs. J. Algorithms 21:2 (1996) 358-402 151
- (1996) J. Algorithms , vol.21 , Issue.2 , pp. 358-402
- Bodlaender, H.L.¹ Kloks, T.²

7
- 0030371952
- Efficient parallel algorithms for graphs of bounded tree-width
- Lagergren, J.: Efficient parallel algorithms for graphs of bounded tree-width. J. Algorithms 20 (1996) 20-44 149
- (1996) J. Algorithms 20 , pp. 20-44
- Lagergren, J.¹

8
- 0026979104
- Finding approximate separators and computing treewidth quickly
- Reed, B.: Finding approximate separators and computing treewidth quickly. Proc. 24th STOC (1992) 221-228 149
- (1992) Proc. 24Th STOC , pp. 221-228
- Reed, B.¹

10
- 0000673493
- Graph Minors II. Algorithmic aspects of tree-width
- Robertson, N., Seymour P. D.: Graph Minors II. Algorithmic aspects of tree-width. J. Algorithms 7 (1986) 309-322 148, 149
- (1986) J. Algorithms , vol.7 , pp. 309-322
- Robertson, N.¹ Seymour, P.D.²

11
- 38249038848
- Graph Minors VI. Disjoint paths across a disk
- Robertson, N., Seymour P. D.: Graph Minors VI. Disjoint paths across a disk. J. Combin.TheorySer. B 45 (1986) 115-138 149
- (1986) J. Combin.Theoryser. B , vol.45 , pp. 115-138
- Robertson, N.¹ Seymour, P.D.²

12
- 0002848005
- Graph Minors XIII. The disjoint path problem
- Robertson, N., Seymour, P.D.: Graph Minors XIII. The disjoint path problem. J. Combin.Theory Ser.B 63 (1995) 65-110 149
- (1995) J. Combin.Theory Ser.B , vol.63 , pp. 65-110
- Robertson, N.¹ Seymour, P.D.²

13
- 45449125778
- Graph Minors VII. Disjoint paths on a surface
- Robertson, N., Seymour P. D.: Graph Minors VII. Disjoint paths on a surface. J. Combin.Theory Ser.B (1988) 212-254 149
- (1988) J. Combin.Theory Ser.B , pp. 212-254
- Robertson, N.¹ Seymour, P.D.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.