SCOPUS 정보 검색 플랫폼

Volumn 4, Issue 3, 2008, Pages

Optimal branch-decomposition of planar graphs in O(n3) time

Author keywords

Branch decompositions; Planar graphs

Indexed keywords

OPTIMAL BRANCH-DECOMPOSITION; PLANAR GRAPHS;

EID: 47249100718 PISSN: 15496325 EISSN: 15496333 Source Type: Journal
DOI: 10.1145/1367064.1367070 Document Type: Article

Times cited : (59)

References (12)

1
- 0000245736
- Complexity of finding embedding in a k-tree
- ARNBORG, S., CORNEIL, D., AND PROSKUROWSKI, A. 1987. Complexity of finding embedding in a k-tree. SIAM J. Disc. Math. 8, 277-284.
- (1987) SIAM J. Disc. Math , vol.8 , pp. 277-284
- ARNBORG, S.¹ CORNEIL, D.² PROSKUROWSKI, A.³

2
- 0000504885
- Easy problems for tree-decomposable graphs
- ARNBORG, S., LAGERGREN, J., AND SEESE, D. 1991. Easy problems for tree-decomposable graphs. J. Algorithms 12, 308-340.
- (1991) J. Algorithms , vol.12 , pp. 308-340
- ARNBORG, S.¹ LAGERGREN, J.² SEESE, D.³

3
- 85037918238
- A tourist guide through treewidth
- BODLAENDER, H. 1993. A tourist guide through treewidth. Acta Cybern. 11, 1-21.
- (1993) Acta Cybern , vol.11 , pp. 1-21
- BODLAENDER, H.¹

4
- 0001294529
- A linear time algorithm for finding tree-decomposition of small treewidth
- BODLAENDER, H. 1996. A linear time algorithm for finding tree-decomposition of small treewidth. SIAM J. Comput. 25, 1305-1317.
- (1996) SIAM J. Comput , vol.25 , pp. 1305-1317
- BODLAENDER, H.¹

5
- 84951044027
- Constructive linear time algorithm for branchwidth
- BODLAENDER, H., AND THILIKOS, D. 1997. Constructive linear time algorithm for branchwidth. In Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP'97). 627-637.
- (1997) Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP'97) , pp. 627-637
- BODLAENDER, H.¹ THILIKOS, D.²

6
- 3342990953
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- DEMAINE, E., HAJIAGHAYI, M., NISHIMURA, N., RADGE, P., AND THILIKOS, D. 2004. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. 69-2, 166-195.
- (2004) J. Comput. Syst. Sci , vol.69 -2 , pp. 166-195
- DEMAINE, E.¹ HAJIAGHAYI, M.² NISHIMURA, N.³ RADGE, P.⁴ THILIKOS, D.⁵

7
- 14544305096
- Planar branch decompositions II: The cycle method
- HICKS, I. 2005. Planar branch decompositions II: The cycle method. INFORMS J. Comput. 17, 4, 413-421.
- (2005) INFORMS J. Comput , vol.17 , Issue.4 , pp. 413-421
- HICKS, I.¹

8
- 45449086580
- Branch and tree decomposition techniques for discrete optimization
- HICKS, I., KOSTER, A., AND KOLOTOǦLU, E. 2005. Branch and tree decomposition techniques for discrete optimization. In TutORials in Operation Research: INFORMS-New Orleans 2005. 1-29.
- (2005) TutORials in Operation Research: INFORMS-New Orleans 2005 , pp. 1-29
- HICKS, I.¹ KOSTER, A.² KOLOTOǦLU, E.³

9
- 0001977866
- Graph minors I. Excluding a forest
- ROBERTSON, N., AND SEYMOUR, P. 1983. Graph minors I. Excluding a forest. J. Combinat. Theory, Ser. B 35, 39-61.
- (1983) J. Combinat. Theory, Ser. B , vol.35 , pp. 39-61
- ROBERTSON, N.¹ SEYMOUR, P.²

10
- 0000673493
- Graph minors II. Algorithmic aspects of tree-width
- ROBERTSON, N., AND SEYMOUR, P. 1986. Graph minors II. Algorithmic aspects of tree-width. J. Algor. 7, 309-322.
- (1986) J. Algor , vol.7 , pp. 309-322
- ROBERTSON, N.¹ SEYMOUR, P.²

11
- 0001227241
- Graph minors X. Obstructions to tree decomposition
- ROBERTSON, N., AND SEYMOUR, P. 1991. Graph minors X. Obstructions to tree decomposition. J. Combinat. Theory, Ser. B 52, 153-190.
- (1991) J. Combinat. Theory, Ser. B , vol.52 , pp. 153-190
- ROBERTSON, N.¹ SEYMOUR, P.²

12
- 0038521887
- Call routing and the ratcatcher
- SEYMOUR, P., AND THOMAS, R. 1994. Call routing and the ratcatcher. Combinatorica 14, 2, 217-241.
- (1994) Combinatorica , vol.14 , Issue.2 , pp. 217-241
- SEYMOUR, P.¹ THOMAS, R.²

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