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

메뉴 건너뛰기

Information Processing Letters

Volumn 8, Issue 3, 1979, Pages 131-136

A note on the graph isomorphism counting problem

(1) Mathon, Rudolf a

a UNIVERSITY OF TORONTO (Canada)

Author keywords

counting; Graph; isomorphism; polynomial reduction

Indexed keywords

EID: 0001460788 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/0020-0190(79)90004-8 Document Type: Article

Times cited : (156)

References (9)

1
- 84914863044
- Institut für Informationsverarbeitung, Technical University Graz, Austria, To appear.
- (1978) Efficient worst-case data structures for range searching, Report 10
- Bentley¹ Maurer²

2
- 0011703962
- The complexity of finding fixed-radius near neighbours
- (1977) Information Processing Lett. , vol.6 , pp. 209-212
- Bentley¹ Stanat² Williams³

3
- 0000488913
- Location of a point in a planar subdivision and its applications
- (1977) SIAM Journal on Computing , vol.6 , Issue.3 , pp. 594-606
- Lee¹ Preparata²

4
- 85035070413
- Applications of a planar separator theorem
- (1977) 18th FOCS Conference , pp. 162-170
- Lipton¹ Tarjan²

5
- 0004208520
- McGraw Hill, New York
- (1968) Introduction to Combinatorial Mathematics
- Liu¹

6
- 85059200022
- Geometric complexity
- (1975) 7th Annual ACM STOC Symposium , pp. 224-233
- Shamos¹

7
- 85063287628
- Closest point problems
- (1975) 16th FOCS Conference , pp. 151-162
- Shamos¹ Hoey²

8
- 0040662404
- Finding nearest neighbours
- (1976) Information Processing Lett. , vol.5 , pp. 63-65
- Yuval¹

9
- 0000245713
- Multidimensional searching problems
- (1976) SIAM Journal on Computing , vol.5 , Issue.2 , pp. 181-186
- Dobkin¹ Lipton²

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