SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Theoretical Computer Science

Volumn 276, Issue 1-2, 2002, Pages 17-32

Listing all potential maximal cliques of a graph

(2) Bouchitté, Vincent a Todinca, Ioan a

a UNIVERSITÉ DE LYON (France)

Author keywords

Graph algorithms; Minimal separators; Potential maximal cliques; Treewidth

Indexed keywords

ALGORITHMS; POLYNOMIALS; SET THEORY; TRIANGULATION;

POTENTIAL MAXIMAL CLIQUES;

GRAPH THEORY;

EID: 0037029296 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(01)00007-X Document Type: Article

Times cited : (104)

References (34)

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

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

3
- 0002003951
- Linear time algorithms for NP-hard problems restricted to partial k-trees
- (1989) Discrete Appl. Math. , vol.23 , pp. 11-24
- Arnborg, S.¹ Proskurowski, A.²

4
- 0008779758
- Generating all the minimal separators of a graph, Workshop on Graph-theoretic Concepts in Computer Science (WG'99), Springer, Berlin
- (1999) Lecture Notes in Computer Science , vol.1665
- Berry, A.¹ Bordat, J.P.² Cogis, O.³

5
- 85037918238
- A tourist guide through treewidth
- (1993) Acta Cybernet. , vol.11 , pp. 1-23
- Bodlaender, H.¹

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

7
- 84947711895
- Treewidth: Algorithmic techniques and results
- Proc. of MFCS'97, Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1295 , pp. 19-36
- Bodlaender, H.¹

8
- 84948949595
- Reduction algorithms for constructing solutions of graphs with small treewidth
- Proc. COCOON'96, Springer, Berlin
- (1996) Lecture Notes in Computer Science , vol.1090 , pp. 199-208
- Bodlaender, H.¹ De Fluiter, B.²

9
- 0008799320
- Approximating treewidth, pathwidth, and minimum elimination tree height
- (1995) J. Algorithms , vol.18 , pp. 238-255
- Bodlaender, H.¹ Gilbert, J.R.² Hafsteinsson, H.³ Kloks, T.⁴

10
- 0032280076
- Linear-time register allocation for a fixed number of registers
- San Francisco, CA, 1998, ACM, New York
- (1998) Proc. 9th Annu. ACM-SIAM Symp. on Discrete Algorithms , pp. 574-583
- Bodlaender, H.¹ Gustedt, J.² Telle, J.A.³

11
- 84896693545
- Minimal triangulations for graphs with "few" minimal separators
- Proc. 6th Annu. European Symp. on Algorithms (ESA'98), Springer, Berlin
- (1998) Lecture Notes in Computer Science , vol.1461 , pp. 344-355
- Bouchitté, V.¹ Todinca, I.²

12
- 84957046914
- Treewidth and minimum fill-in of weakly triangulated graphs
- Proc. 16th Symp. on Theoretical Aspects of Computer Science (STACS'99), Springer, Berlin
- (1999) Lecture Notes in Computer Science , vol.1563 , pp. 197-206
- Bouchitté, V.¹ Todinca, I.²

13
- 84990192698
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- ISAAC'96, Springer, Berlin
- (1996) Lecture Notes in Computer Science , vol.1178 , pp. 146-155
- Chang, M.S.¹

14
- 0001587729
- The monadic second-order logic of graphs III: Treewidth, forbidden minors and complexity issues
- (1992) Informatique Théorique , vol.26 , pp. 257-286
- Courcelle, B.¹

15
- 0027553197
- Monadic second-order evaluations on tree-decomposable graphs
- (1993) Theoret. Comput. Sci. , vol.109 , pp. 49-82
- Courcelle, B.¹ Mosbah, M.²

16
- 0003947606
- Academic Press, New York
- (1980) Algorithmic Graph Theory and Perfect Graphs
- Golumbic, M.C.¹

17
- 84951102956
- Dynamic algorithms for graphs of bounded treewidth
- Proc. 24th Internat. Colloq. on Automata, Languages, and Programming (ICALP'97), Springer, Berlin
- (1997) Lecture Notes in Computer Science , pp. 292-302
- Hagerup, T.¹

18
- 0025742006
- Inferring evolutionary history from DNA sequences
- (1990) Proc. 31st Annu. Symp. on Foundations of Computer Science , pp. 362-371
- Kannan, S.¹ Warnow, T.²

19
- 85014857667
- Computing treewidth and minimum fill-in: All you need are the minimal separators
- Proc. 1st Ann. European Symp. on Algorithms (ESA'93), Springer, Berlin
- (1993) Lecture Notes in Computer Science , vol.726 , pp. 260-271
- Kloks, T.¹ Bodlaender, H.L.² Müller, H.³ Kratsch, D.⁴

20
- 0000914267
- Erratum to the ESA'93 proceedings, Proc. 2nd Annu. European Symp. on Algorithms (ESA'94), Springer, Berlin
- (1994) Lecture Notes in Computer Science , vol.855 , pp. 508
- Kloks, T.¹ Bodlaender, H.L.² Müller, H.³ Kratsch, D.⁴

21
- 0001162493
- Treewidth of chordal bipartite graphs
- (1995) J. Algorithms , vol.19 , Issue.2 , pp. 266-281
- Kloks, T.¹ Kratsch, D.²

22
- 0001740507
- Listing all minimal separators of a graph
- (1998) SIAM J. Comput. , vol.27 , Issue.3 , pp. 605-613
- Kloks, T.¹ Kratsch, D.²

23
- 84947735120
- Approximating the bandwidth for asteroidal triple-free graphs
- Proc. 3rd Annu. European Symp. on Algorithms (ESA'95), Springer, Berlin
- (1995) Lecture Notes in Computer Science , vol.979 , pp. 434-447
- Kloks, T.¹ Kratsch, D.² Müller, H.³

24
- 0031118743
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- (1997) Theoret. Comput. Sci. , vol.175 , pp. 309-335
- Kloks, T.¹ Kratsch, D.² Spinrad, J.³

25
- 0000182981
- Minimum fill-in of circle and circular-arc graphs
- (1998) J. Algorithms , vol.28 , Issue.2 , pp. 272-289
- Kloks, T.¹ Kratsch, D.² Wong, C.K.³

26
- 0026840122
- The multifrontal method for sparse matrix solution: Theory and practice
- (1992) SIAM Rev. , vol.34 , Issue.1 , pp. 82-109
- Liu, J.W.H.¹

27
- 0000865792
- Characterizations and algorithmic applications of chordal graph embeddings
- (1997) Discrete Appl. Math. , vol.79 , Issue.1-3 , pp. 171-188
- Parra, A.¹ Scheffler, P.²

28
- 48749140617
- Graphs minors. III. Planar tree-width
- (1984) J. Combin. Theory Ser. B , vol.36 , pp. 49-64
- Robertson, N.¹ Seymour, P.²

29
- 0000673493
- Graphs minors. II. Algorithmic aspects of tree-width
- (1986) J. Algorithms , vol.7 , pp. 309-322
- Robertson, N.¹ Seymour, P.²

30
- 0014928358
- Triangulating graphs and the elimination process
- (1970) J. Math. Anal. Appl. , vol.32 , pp. 597-609
- Rose, D.J.¹

31
- 0001566962
- Treewidth of circular-arc graphs
- (1994) SIAM J. Discrete Math. , vol.7 , pp. 647-655
- Sundaram, R.¹ Sher Singh, K.² Pandu Rangan, C.³

32
- 0008779759
- All structured programs have small tree width and good register allocation
- (1998) Inform. and Comput. , vol.142 , Issue.2 , pp. 159-181
- Thorup, M.¹

33
- 0003684499
- Ph.D. Thesis, École Normale Supérieure de Lyon
- (1999) Aspects algorithmiques des triangulations minimales des graphes
- Todinca, I.¹

34
- 0002463920
- Computing the minimum fill-in is NP-complete
- (1981) SIAM J. Algebraic Discrete Methods , vol.2 , pp. 77-79
- Yannakakis, M.¹

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