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

메뉴 건너뛰기

Information Processing Letters

Volumn 4, Issue 4, 1976, Pages 83-84

Subgraph isomorphism, matching relational structures and maximal cliques

(2) Barrow, H G a Burstall, R M a

a UNIVERSITY OF EDINBURGH (United Kingdom)

Author keywords

Cliques; graphs; isomorphism; matching

Indexed keywords

EID: 3142669879 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/0020-0190(76)90049-1 Document Type: Article

Times cited : (156)

References (4)

1
- 84898175928
- A versatile computer-controlled assembly system
- Stanford, California
- (1973) Proc. of Third Intern. Joint Conf. Artificial Intelligence , pp. 298-307
- Ambler¹ Barrow² Brown³ Burstall⁴ Popplestone⁵

2
- 84976668743
- Algorithm 457: finding all the cliques of an undirected graph
- (1973) C.A.C.M. , vol.16 , pp. 575
- Bron¹ Kerbosch²

3
- 85032879874
- Computer Science Department, Queen's University, Belfast, to be published.
- (1974) Cliques of a graph — large or small
- Johnston¹

4
- 0003037529
- Reducibility among combinatorial problems
- R.E. Miller, J.W. Thatcher, Plenum Press
- (1972) Complexity of Computer Computations , pp. 85-103
- Karp¹

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