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

메뉴 건너뛰기

Theoretical Computer Science

Volumn 10, Issue 2, 1980, Pages 111-121

The directed subgraph homeomorphism problem

(3) Fortune, Steven a Hopcroft, John a Wyllie, James a

a Department of Computer Science Cornell University ^* (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001228266 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(80)90009-2 Document Type: Article

Times cited : (616)

References (7)

1
- 0000891810
- Algorithm for solution of a problem of maximum flow in a network with power estimation
- (1970) Soviet Math. Dokl. , vol.2 , Issue.5 , pp. 1277-1280
- Dinic¹

2
- 0001488083
- On the complexity of timetable and multi-commodity flow problems
- (1976) SIAM Journal on Computing , vol.5 , Issue.4 , pp. 691-703
- Even¹ Itai² Shamir³

3
- 0347095766
- Flow graph reducibility
- (1972) SIAM Journal on Computing , vol.1 , Issue.2 , pp. 188-202
- Hecht¹ Ullman²

4
- 84976853954
- Dichotomization reachability and the forbidden subgraph problem
- Hershey, PA
- (1976) Proc. Eighth Annual ACM Symposium on Theory of Computing , pp. 126-134
- Hunt¹ Szymanski²

5
- 0018058201
- The subgraph homeomorphism problem
- San Diego, CA
- (1978) Proc. Tenth Annual ACM Symposium on Theory of Computing , pp. 40-50
- LaPaugh¹ Rivest²

6
- 84976859871
- Finding two disjoint paths between two pairs of vertices in a graph
- (1978) Journal of the ACM , vol.25 , Issue.1 , pp. 1-9
- Perl¹ Shiloach²

7
- 0002387123
- Stanford University Tech. Rep. CS-78-654
- (1978) The two paths problem is polynomial
- Shiloach¹

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