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

메뉴 건너뛰기

Volumn 21, Issue 1, 2001, Pages 5-12

Edge-coloring bipartite multigraphs in O(E log D) time

(3) Cole, Richard b Ost, Kirstin b Schirra, Stefan a

a MAX PLANCK INSTITUTE FOR INFORMATICS (Germany)

b SAP Retail Solutions (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040438506 PISSN: 02099683 EISSN: None Source Type: Journal
DOI: 10.1007/s004930170002 Document Type: Article

Times cited : (189)

References (19)

1
- 0000175577
- On edge coloring bipartite graphs
- R. COLE, J. HOPCROFT: On edge coloring bipartite graphs, SIAM J. Comput., 11 (1982), 540-546.
- (1982) SIAM J. Comput. , vol.11 , pp. 540-546
- Cole, R.¹ Hopcroft, J.²

2
- 0010617295
- Ph.D.-Thesis, Cornell University, August
- R. COLE: Two problems in graph theory, Ph.D.-Thesis, Cornell University, August 1982.
- (1982) Two Problems in Graph Theory
- Cole, R.¹

3
- 0040469268
- NYU Computer Science Dept. Technical Report No. 792
- R. COLE, K. OST, S. SCHIRRA: Edge coloring bipartite multigraphs in O(E log D) time, NYU Computer Science Dept. Technical Report No. 792, 1999.
- (1999) Edge Coloring Bipartite Multigraphs in O(E log D) Time
- Cole, R.¹ Ost, K.² Schirra, S.³

4
- 0001575222
- Using Euler partitions to edge color bipartite multigraphs
- H. GABOW: Using Euler partitions to edge color bipartite multigraphs, Internat. J. Comput. Inform. Sci., 5 (1976), 345-355.
- (1976) Internat. J. Comput. Inform. Sci. , vol.5 , pp. 345-355
- Gabow, H.¹

5
- 0018047224
- Algorithms for edge coloring bipartite graphs
- San Diego, CA
- th Annual ACM Symp. on Theory of Computing (STOC), San Diego, CA., 1978, 184-192.
- (1978) th Annual ACM Symp. on Theory of Computing (STOC) , pp. 184-192
- Gabow, H.¹ Kariv, O.²

6
- 0001118054
- Algorithms for edge coloring bipartite graphs
- H. GABOW, O. KARIV: Algorithms for edge coloring bipartite graphs, SIAM J. Comput., 11 (1982), 117-129.
- (1982) SIAM J. Comput. , vol.11 , pp. 117-129
- Gabow, H.¹ Kariv, O.²

7
- 0010571491
- The construction of class-teachers time-tables
- Munich North-Holland, Amsterdam
- C. GOTLIEB: The construction of class-teachers time-tables, Proc. IFIP Congress 62, Munich (North-Holland, Amsterdam, 1963), 73-77.
- (1963) Proc. IFIP Congress 62 , pp. 73-77
- Gotlieb, C.¹

8
- 0000429528
- The NP-completeness of edge-coloring
- I. HOLYER: The NP-completeness of edge-coloring, SIAM J. Comput., 10 (1981), 718-720.
- (1981) SIAM J. Comput. , vol.10 , pp. 718-720
- Holyer, I.¹

9
- 0001009871
- 5/2 algorithm for maximum matchings in bipartite graphs
- 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 2 (1973), 225-231.
- (1973) SIAM J. Comput. , vol.2 , pp. 225-231
- Hopcroft, J.¹ Karp, R.²

10
- 0010618580
- Edge-coloring bipartite graphs
- A. KAPOOR, R. RIZZI: Edge-coloring bipartite graphs, J. Algorithms, 34 (2000), 390-396.
- (2000) J. Algorithms , vol.34 , pp. 390-396
- Kapoor, A.¹ Rizzi, R.²

11
- 0026985376
- Efficient PRAM simulation on a distributed memory machine
- Victoria, B.C., Canada
- th Annual ACM Symp. on Theory of Computing (STOC), Victoria, B.C., Canada, 1992, 318-326.
- (1992) th Annual ACM Symp. on Theory of Computing (STOC) , pp. 318-326
- Karp, R.¹ Luby, M.² Meyer Auf Der Heide, F.³

12
- 34250966677
- Über graphen und ihre anwendung auf determinententheorie und mengenlehre
- D. KÖNIG: Über Graphen und ihre Anwendung auf Determinententheorie und Mengenlehre, Math. Annalen, 77 (1916), 453-465.
- (1916) Math. Annalen , vol.77 , pp. 453-465
- König, D.¹

13
- 0003558735
- Holt, Rinehart and Winston, New York
- E. LAWLER: Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
- (1976) Combinatorial Optimization: Networks and Matroids
- Lawler, E.¹

14
- 0019531866
- A fast parallel algorithm for routing in permutation networks
- G. LEV, N. PIPPENGER, L. G. VALIANT: A fast parallel algorithm for routing in permutation networks, IEEE Trans. Comput., C-30 (1981), 93-110.
- (1981) IEEE Trans. Comput. , vol.30 C , pp. 93-110
- Lev, G.¹ Pippenger, N.² Valiant, L.G.³

15
- 0347565492
- Edge-coloring algorithms
- (Jan van Leeuwen ed.), LNCS 1000
- SH. NAKANO, X. ZHOU, T. NISHIZEKI: Edge-coloring algorithms, in: Computer Science Today: Recent Trends and Developments, (Jan van Leeuwen ed.), LNCS 1000, 1995, 172-183.
- (1995) Computer Science Today: Recent Trends and Developments , pp. 172-183
- Nakano, S.¹ Zhou, X.² Nishizeki, T.³

16
- 85017258578
- Ph.D thesis, Universität des Saarlandes, January, (in German.)
- K. OST: Algorithmen für das Kantenfärbungsproblem, Ph.D thesis, Universität des Saarlandes, January, 1995 (in German.)
- (1995) Algorithmen für das Kantenfärbungsproblem
- Ost, K.¹

17
- 0032266933
- Bipartite edge coloring in O(Δm) time
- A. SCHRIJVER: Bipartite edge coloring in O(Δm) time, SIAM J. Comput., 28 (1999), 841-846.
- (1999) SIAM J. Comput. , vol.28 , pp. 841-846
- Schrijver, A.¹

18
- 0039876278
- Edge coloring bipartite graphs efficiently
- SION
- J. SIBEYN: Edge coloring bipartite graphs efficiently, Proc. Computing Science in the Netherlands, SION, 1992, 269-278.
- (1992) Proc. Computing Science in the Netherlands , pp. 269-278
- Sibeyn, J.¹

19
- 0002935868
- On an estimate of the chromatic class of a p-graph
- V. VIZING: On an estimate of the chromatic class of a p-graph, (Russian) Diskret. Analiz., 3 (1964), 25-30.
- (1964) Diskret. Analiz. , vol.3 , pp. 25-30
- Vizing, V.¹

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