SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1776 LNCS, Issue , 2000, Pages 18-27

Small maximal matchings in random graphs

(1) Zito, Michele a

a UNIVERSITY OF LIVERPOOL (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM DYNAMICS; BIPARTITE GRAPHS; CUBIC GRAPH; HIGH PROBABILITY; LINEAR DIFFERENTIAL EQUATION; MAXIMAL MATCHINGS; RANDOM D-REGULAR GRAPHS; RANDOM GRAPHS;

ALGORITHMS; DIFFERENTIAL EQUATIONS; INFORMATION SCIENCE; GRAPHIC METHODS;

GRAPH THEORY;

EID: 84896764471 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/10719839_2 Document Type: Conference Paper

Times cited : (5)

References (11)

1
- 0004219960
- Academic Press
- B. Bollobás. Random Graphs. Academic Press, 1985.
- (1985) Random Graphs
- Bollobás, B.¹

2
- 0000927535
- Paths, trees and flowers
- J. Edmonds. Paths, Trees and Flowers. Canadian Journal of Math., 15:449-467, 1965.
- (1965) Canadian Journal of Math. , vol.15 , pp. 449-467
- Edmonds, J.¹

3
- 0001630960
- On the existence of a factor of degree one of a connected random graph
- P. Erdos and A. Rényi. On the Existence of a Factor of Degree One of a Connected Random Graph. Acta Mathematica Academiae Scientiarum Hungaricae, 17(3-4):359-368, 1966.
- (1966) Acta Mathematica Academiae Scientiarum Hungaricae , vol.17 , Issue.3-4 , pp. 359-368
- Erdos, P.¹ Rényi, A.²

4
- 84976163810
- On colouring random graphs
- G. R. Grimmett and C. J. H. McDiarmid. On Colouring Random Graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 77:313-324, 1975.
- (1975) Mathematical Proceedings of the Cambridge Philosophical Society , vol.77 , pp. 313-324
- Grimmett, G.R.¹ McDiarmid, C.J.H.²

5
- 0001009871
- 5/2 algorithm for maximal matching in bipartite graphs
- 5/2 Algorithm for Maximal Matching in Bipartite Graphs. SIAM Journal on Computing, 2:225-231, 1973.
- (1973) SIAM Journal on Computing , vol.2 , pp. 225-231
- Hopcroft, J.¹ Karp, R.²

6
- 0001872985
- An analysis of the greedy heuristic for independence systems
- B. Korte and D. Hausmann. An Analysis of the Greedy Heuristic for Independence Systems. Annals of Discrete Mathematics, 2:65-74, 1978.
- (1978) Annals of Discrete Mathematics , vol.2 , pp. 65-74
- Korte, B.¹ Hausmann, D.²

7
- 0013459441
- Independent sets in regular graphs of high girth
- B. D. McKay. Independent Sets in Regular Graphs of High Girth. Ars Combinatoria, 23A:179-185, 1987.
- (1987) Ars Combinatoria , vol.23 A , pp. 179-185
- McKay, B.D.¹

8
- 85064850083
- 1/2e) algorithm for finding maximum matching in general graphs
- New York
- 1/2e) Algorithm for Finding Maximum Matching in General Graphs. In Proceedings of the 21st Annual Symposium on Foundations of Computer Science, pages 17-27, New York, 1980.
- (1980) Proceedings of the 21st Annual Symposium on Foundations of Computer Science , pp. 17-27
- Micali, S.¹ Vazirani, V.V.²

9
- 21344437483
- Differential equations for random processes and random graphs
- N. C. Wormald. Differential Equations for Random Processes and Random Graphs. Annals of Applied Probability, 5:1217-1235, 1995.
- (1995) Annals of Applied Probability , vol.5 , pp. 1217-1235
- Wormald, N.C.¹

10
- 0001559260
- Edge dominating sets in graphs
- June
- M. Yannakakis and F. Gavril. Edge Dominating Sets in Graphs. SIAM Journal on Applied Mathematics, 38(3):364-372, June 1980.
- (1980) SIAM Journal on Applied Mathematics , vol.38 , Issue.3 , pp. 364-372
- Yannakakis, M.¹ Gavril, F.²

11
- 0003810695
- PhD thesis, Department of Computer Science, University of Warwick
- M. Zito. Randomised Techniques in Combinatorial Algorithmics. PhD thesis, Department of Computer Science, University of Warwick, 1999.
- (1999) Randomised Techniques in Combinatorial Algorithmics
- Zito, M.¹

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