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

메뉴 건너뛰기

Journal of Algorithms

Volumn 58, Issue 1, 2006, Pages 67-78

Polynomial time recognition of unit circular-arc graphs

(5) Durán, Guillermo a Gravano, Agustín b McConnell, Ross M c Spinrad, Jeremy d Tucker, Alan e

a DEPARTAMENTO DE FÍSICA (Chile)

b UNIVERSIDAD DE BUENOS AIRES (Argentina)

c Colorado State University (United States)

d VANDERBILT UNIVERSITY (United States)

e Stony Brook University (United States)

Author keywords

Circular arc graphs; Graph algorithms; Polynomial recognition; Proper circular arc graphs; Unit circular arc graphs

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PRINCIPAL COMPONENT ANALYSIS; THEOREM PROVING;

CIRCULAR-ARC GRAPHS; GRAPH ALGORITHMS; POLYNOMIAL RECOGNITION; PROPER CIRCULAR-ARC GRAPHS; UNIT CIRCULAR-ARC GRAPHS;

ALGORITHMS;

EID: 28444481676 PISSN: 01966774 EISSN: None Source Type: Journal
DOI: 10.1016/j.jalgor.2004.08.003 Document Type: Article

Times cited : (14)

References (18)

1
- 0004116989
- McGraw-Hill Boston
- T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms 2001 McGraw-Hill Boston
- (2001) Introduction to Algorithms
- Cormen, T.H.¹ Leiserson, C.E.² Rivest, R.L.³ Stein, C.⁴

2
- 0030128324
- Linear time representation algorithms for proper circular-arc graphs and proper interval graphs
- X. Deng, P. Hell, and J. Huang Linear time representation algorithms for proper circular-arc graphs and proper interval graphs SIAM J. Comput. 25 1996 390 403
- (1996) SIAM J. Comput. , vol.25 , pp. 390-403
- Deng, X.¹ Hell, P.² Huang, J.³

3
- 28444460846
- On some subclasses of circular-arc graphs
- G. Durán, and M. Lin On some subclasses of circular-arc graphs Congressus Numerantium 146 2000 201 212
- (2000) Congressus Numerantium , vol.146 , pp. 201-212
- Durán, G.¹ Lin, M.²

4
- 0016316852
- Algorithms on circular-arc graphs
- F. Gavril Algorithms on circular-arc graphs Networks 4 1974 357 369
- (1974) Networks , vol.4 , pp. 357-369
- Gavril, F.¹

5
- 0020732246
- A linear time algorithm for a special case of disjoint set union
- H.N. Gabow, and R.E. Tarjan A linear time algorithm for a special case of disjoint set union J. Comput. System Sci. 30 1985 209 221
- (1985) J. Comput. System Sci. , vol.30 , pp. 209-221
- Gabow, H.N.¹ Tarjan, R.E.²

6
- 0003947606
- Academic Press New York
- M. Golumbic Algorithm Graph Theory and Perfect Graphs 1980 Academic Press New York
- (1980) Algorithm Graph Theory and Perfect Graphs
- Golumbic, M.¹

7
- 0348098752
- Efficient union-find for planar graphs and other sparse graph classes
- J. Gustedt Efficient union-find for planar graphs and other sparse graph classes Theoret. Comput. Sci. 203 1998 123 141
- (1998) Theoret. Comput. Sci. , vol.203 , pp. 123-141
- Gustedt, J.¹

8
- 85004844311
- Some applications of graph theory and related non-metric techniques to problems of approximate seriation: The case of symmetry proximity measures
- L. Hubert Some applications of graph theory and related non-metric techniques to problems of approximate seriation: the case of symmetry proximity measures British J. Math. Statist. Psych. 27 1974 133 153
- (1974) British J. Math. Statist. Psych. , vol.27 , pp. 133-153
- Hubert, L.¹

9
- 0942301007
- Linear-time recognition of circular-arc graphs
- R.M. McConnell Linear-time recognition of circular-arc graphs Algorithmica 37 2 2003 93 147
- (2003) Algorithmica , vol.37 , Issue.2 , pp. 93-147
- McConnell, R.M.¹

10
- 0041480829
- book manuscript
- J. Spinrad, Representations of Graphs, book manuscript, 1997
- (1997) Representations of Graphs
- Spinrad, J.¹

11
- 17044447672
- Circular genetic maps
- F. Stahl Circular genetic maps J. Cell Physiol. 70 Suppl. 1 1967 1 12
- (1967) J. Cell Physiol. , vol.70 , Issue.1 , pp. 1-12
- Stahl, F.¹

12
- 0004681887
- Scheduling of traffic lights - A new approach
- K. Stouffers Scheduling of traffic lights - a new approach Transportation Res. 2 1968 199 234
- (1968) Transportation Res. , vol.2 , pp. 199-234
- Stouffers, K.¹

13
- 0042338823
- Characterizing circular-arc graphs
- A. Tucker Characterizing circular-arc graphs Bull. Amer. Math. Soc. 76 1970 1257 1260
- (1970) Bull. Amer. Math. Soc. , vol.76 , pp. 1257-1260
- Tucker, A.¹

14
- 84972526497
- Matrix characterizations of circular-arc graphs
- A. Tucker Matrix characterizations of circular-arc graphs Pacific J. Math. 38 1971 535 545
- (1971) Pacific J. Math. , vol.38 , pp. 535-545
- Tucker, A.¹

15
- 0040073599
- Structure theorems for some circular-arc graphs
- A. Tucker Structure theorems for some circular-arc graphs Discrete Math. 7 1974 167 195
- (1974) Discrete Math. , vol.7 , pp. 167-195
- Tucker, A.¹

16
- 0016580707
- Coloring a family of circular-arc graphs
- A. Tucker Coloring a family of circular-arc graphs SIAM J. Appl. Math. 29 1975 493 502
- (1975) SIAM J. Appl. Math. , vol.29 , pp. 493-502
- Tucker, A.¹

17
- 0006631387
- An efficient test for circular-arc graphs
- A. Tucker An efficient test for circular-arc graphs SIAM J. Comput. 9 1980 1 24
- (1980) SIAM J. Comput. , vol.9 , pp. 1-24
- Tucker, A.¹

18
- 0141534101
- Revisiting Tucker's algorithm to color circular arc graphs
- M. Valencia-Pabon Revisiting Tucker's algorithm to color circular arc graphs SIAM J. Comput. 32 2003 1067 1072
- (2003) SIAM J. Comput. , vol.32 , pp. 1067-1072
- Valencia-Pabon, M.¹

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