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

메뉴 건너뛰기

Zeitschrift für Operations Research

Volumn 32, Issue 3-4, 1988, Pages 201-211

The computational complexity of graph problems with succinct multigraph representation

(2) Karpinski, M a Wagner, K W b

a UNIVERSITY OF BONN (Germany)

b UNIVERSITY OF WÜRZBURG (Germany)

Author keywords

complexity; graph algorithms; matching; succinct presentation

Indexed keywords

EID: 0348037975 PISSN: 03409422 EISSN: 14325217 Source Type: Journal
DOI: 10.1007/BF01928922 Document Type: Article

Times cited : (7)

References (14)

1
- 0020495011
- A taxonomy of problems with fast parallel algorithms
- (1985) Information and Control , vol.64 , pp. 2-22
- Cook, S.A.¹

2
- 84934923857
- Perfect matching for regular graphs is AC°-hard for the general matching problem
- IBM Research, San Jose
- (1987) Research Report #RJ 5902 , pp. 1-7
- Dahlhaus, E.¹ Karpinski, M.²

3
- 0020716037
- Succinct representations of graphs
- (1983) Information and Control , vol.56 , pp. 183-198
- Galperin, H.¹ Wigderson, A.²

4
- 84935011669
- Grigoriev DYu, Karpinski M (1987) The matching problem for bipartite graphs with polynomially bounded permanents is in NC. Proc. 28th IEEE FOCS, pp 166–172

5
- 84934939667
- Grötschel M, Lovasz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. To appear in Springer-Verlag

6
- 0040599941
- Proc. IBM Symposium on Complexity of Computer Computation, Plenum Press, New York
- (1972) Reducibilities among combinatorial problems , pp. 85-103
- Karp, R.M.¹

7
- 84935005089
- Karp RM, Upfal E, Wigderson A (1985) Constructing a perfect matching is in random NC. Proc. 17th STOC, pp 22–32

8
- 84934903296
- Lengauer T (1982) The complexity of compacting hierarchically specified layouts of integrated circuits. Proc. 23rd IEEE FOCS, pp 358–368

9
- 84934952414
- Exploiting hierarchy in VLSI design. Proc. Aegean Workshop on Computing, Loutraki
- (1986) LNCS , vol.226 , pp. 180-193
- Lengauer, T.¹

10
- 85034655430
- The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems. Proc. STACS 1987
- (1987) LNCS , vol.247 , pp. 100-113
- Lengauer, T.¹ Wagner, K.W.²

11
- 84935013133
- Lengauer T, Wagner KW (1987) The binary network flow problem is logspace complete for P. TR 138, Institute of Mathematics, University of Augsburg

12
- 84934966803
- Mulmuley K, Vazirani UV, Vazirani VV (1987) Matching is as easy as matrix inversion. Proc. 19th ACM STOC, pp 345–354

13
- 0022913920
- A note on succinct representations of graphs
- (1986) Information and Control , vol.71 , pp. 181-185
- Papadimitriou¹ Yannakakis, M.²

14
- 84947719043
- The complexity of problems concerning graphs with regularities. Proc. of MFCS Conference 1984
- (1984) LNCS , vol.176 , pp. 544-552
- Wagner, K.W.¹

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