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

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 45, Issue 3, 1993, Pages 233-248

On the pathwidth of chordal graphs

(1) Gustedt, Jens a

a TECHNISCHE UNIVERSITÄT BERLIN (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 43949163804 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/0166-218X(93)90012-D Document Type: Article

Times cited : (78)

References (23)

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

2
- 0000504885
- Problems easy for tree-decomposable graphs
- SIAM Journal on Algebraic Discrete Methods
- (1991) J. Algorithms , vol.12 , pp. 308-340
- Arnborg¹ Lagergren² Seese³

3
- 85031917265
- The pathwidth and treewidth of cographs
- Springer, Berlin
- SIAM Journal on Algebraic Discrete Methods
- (1990) Proceedings 2nd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science , vol.47 , pp. 301-309
- Bodlaender¹ Möhring²

4
- 49549154127
- A characterization of rigid circuit graphs
- SIAM Journal on Algebraic Discrete Methods
- (1974) Discrete Mathematics , vol.9 , pp. 205-212
- Bunemann¹

5
- 0001025791
- Split graphs
- F. Hoffman, Louisiana State University, Baton Rouge, LA
- SIAM Journal on Algebraic Discrete Methods
- (1977) Proceedings 8th Southeastern Conference on Combinatorics, Graph Theory and Computing , pp. 311-315
- Földes¹ Hammer²

6
- 0003603813
- Freeman, San Francisco, CA
- SIAM Journal on Algebraic Discrete Methods
- (1979) Computers and Intractability
- Garey¹ Johnson²

7
- 41549118299
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- SIAM Journal on Algebraic Discrete Methods
- (1974) J. Combin. Theory Ser. B , vol.16 , pp. 47-56
- Gavril¹

8
- 0001288032
- A characterization of comparability graphs and of interval graphs
- SIAM Journal on Algebraic Discrete Methods
- (1962) Canadian Journal of Mathematics , vol.16 , pp. 539-548
- Gilmore¹ Hoffman²

9
- 0003947606
- Academic Press, New York
- SIAM Journal on Algebraic Discrete Methods
- (1980) Algorithmic Graph Theory and Perfect Graphs
- Golumbic¹

10
- 38249036758
- The NP-completeness column: An ongoing guide
- SIAM Journal on Algebraic Discrete Methods
- (1987) J. Algorithms , vol.8 , pp. 438-448
- Johnson¹

11
- 0003037529
- Reducibility among combinatorial problems
- R.E. Miller, J.W. Thatcher, Plenum Press, New York
- SIAM Journal on Algebraic Discrete Methods
- (1972) Complexity of Computer Computations , pp. 85-103
- Karp¹

12
- 0009340366
- NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph
- SIAM Journal on Algebraic Discrete Methods
- (1979) International Symposium on Circuits and Systems , pp. 657-660
- Kashiwabara¹ Fujisawa²

13
- 0000288138
- Interval graphs and searching
- SIAM Journal on Algebraic Discrete Methods
- (1985) Discrete Math. , vol.55 , pp. 181-184
- Kirousis¹ Papadimitriou²

14
- 0022874903
- Searching and pebbing
- SIAM Journal on Algebraic Discrete Methods
- (1986) Theoret. Comput. Sci. , vol.47 , pp. 205-218
- Kirousis¹ Papadimitriou²

15
- 0023826724
- The complexity of searching a graph
- SIAM Journal on Algebraic Discrete Methods
- (1988) J. ACM , vol.35 , pp. 18-44
- Megiddo¹ Hakimi² Garey³ Johnson⁴ Papadimitriou⁵

16
- 0002837059
- Algorithmic aspects of comparability graphs and interval graphs
- I. Rival, Reidel, Dordrecht
- SIAM Journal on Algebraic Discrete Methods
- (1985) Graphs and Orders , pp. 41-101
- Möhring¹

17
- 0013187192
- Graph problems related to gate matrix layout and PLA folding
- G. Tinnhofer, Springer, Wien
- SIAM Journal on Algebraic Discrete Methods
- (1990) Computational Graph Theory , pp. 17-32
- Möhring¹

18
- 0024018788
- Min cut is NP-complete for edge weighted trees
- SIAM Journal on Algebraic Discrete Methods
- (1988) Theoret. Comput. Sci. , vol.58 , pp. 209-229
- Monien¹ Sudborough²

19
- 84910995308
- α-vertex separation is NP-hard even for 3-regular graphs
- Technische Universität Berlin, Berlin, also: Computing, to appear
- SIAM Journal on Algebraic Discrete Methods
- (1989) Tech. Rep. 225
- Müller¹ Wagner²

20
- 0001977866
- Graph minors I, excluding a forest
- SIAM Journal on Algebraic Discrete Methods
- (1983) J. Combin. Theory Ser. B , vol.35 , pp. 39-61
- Robertson¹ Seymour²

21
- 0000673493
- Graph minors II, algorithmic aspects of tree-width
- SIAM Journal on Algebraic Discrete Methods
- (1986) J. Algorithms , vol.7 , pp. 309-322
- Robertson¹ Seymour²

22
- 0042806796
- Die Baumweite von Graphen als Maß für die Kompliziertheit algorithmischer Probleme
- Karl-Weierstraß-Institut für Mathematik, Berlin
- SIAM Journal on Algebraic Discrete Methods
- (1989) PhD thesis
- Scheffler¹

23
- 0043028373
- Representations of rigid cycle graphs
- Wayne State University, Detroit, MI
- SIAM Journal on Algebraic Discrete Methods
- (1972) PhD thesis
- Walter¹

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