SCOPUS 정보 검색 플랫폼

Volumn 34, Issue 5, 1997, Pages 337-346

Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; FUNCTIONS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

COCOMPARABILITY GRAPH; CONVEX BIPARTITE GRAPH; FEEDBACK VERTEX SET; POLYNOMIAL TIME ALGORITHM;

ALGORITHMS;

EID: 0031295212 PISSN: 00015903 EISSN: None Source Type: Journal
DOI: 10.1007/s002360050088 Document Type: Article

Times cited : (67)

References (12)

1
- 0004225467
- North-Holland, Amsterdam.
- C. Berge: Graphs. North-Holland, Amsterdam. 1985
- (1985) Graphs.
- Berge, C.¹

2
- 0017216776
- Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms
- K. S. Booth, G. S. Lueker: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. System Sci 13 (1976), 335-379
- (1976) J. Comput. System Sci , vol.13 , pp. 335-379
- Booth, K.S.¹ Lueker, G.S.²

4
- 0023435077
- On domination problems for permutation and other graphs
- A. Brandstädt, D. Kratsch: On domination problems for permutation and other graphs. Theoretical Computer Science 54 (1987) 181-198
- (1987) Theoretical Computer Science , vol.54 , pp. 181-198
- Brandstädt, A.¹ Kratsch, D.²

5
- 38049084478
- Trapezoid graphs and their coloring
- I. Dagan, M.C. Golumbic, R.Y. Pinter: Trapezoid graphs and their coloring. Discrete Appl. Math. 21 (1988), 35-46
- (1988) Discrete Appl. Math. , vol.21 , pp. 35-46
- Dagan, I.¹ Golumbic, M.C.² Pinter, R.Y.³

6
- 0003603813
- Freeman, San Francisco.
- M.R. Garey, D.S. Johnson: Computers and Intractability. A guide to the theory of script N sign℘-Completeness. Freeman, San Francisco. 1979
- (1979) Computers and Intractability. A Guide to the Theory of Script N Sign℘-completeness
- Garey, M.R.¹ Johnson, D.S.²

7
- 0003739188
- Maximum matching in convex bipartite graphs
- F. Glover: Maximum matching in convex bipartite graphs. Naval Res. Logist. Quart. 14 (1967), 313-316
- (1967) Naval Res. Logist. Quart. , vol.14 , pp. 313-316
- Glover, F.¹

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

9
- 0040691108
- Circular convex bipartite graphs: Maximum matching and hamiltonian circuits
- Y.D. Liang, N. Blum: Circular convex bipartite graphs: maximum matching and hamiltonian circuits. Information Processing Letters 56 (1995), 215-219
- (1995) Information Processing Letters , vol.56 , pp. 215-219
- Liang, Y.D.¹ Blum, N.²

10
- 0028548641
- On the feedback vertex set problem in permutation graphs
- Y.D. Liang: On the feedback vertex set problem in permutation graphs. Information Processing Letters 52 (1994), 123-129
- (1994) Information Processing Letters , vol.52 , pp. 123-129
- Liang, Y.D.¹

11
- 0019691164
- Efficient algorithms for finding maximum matching in convex bipartite graphs and related problems
- W. Lipski Jr., F.P. Preparata: Efficient algorithms for finding maximum matching in convex bipartite graphs and related problems. Acta Informatica 15 (1981), 329-346
- (1981) Acta Informatica , vol.15 , pp. 329-346
- Lipski W., Jr.¹ Preparata, F.P.²

12
- 0022104841
- On comparability and permutation graphs
- J. Spinrad: On comparability and permutation graphs. SIAM Journal on Computing 14 (1985), 658-670
- (1985) SIAM Journal on Computing , vol.14 , pp. 658-670
- Spinrad, J.¹

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