Open AccessA O(|V|·|E|) algorithm for maximum matching of graphs
Author(s) -
Tsunehiko Kameda,
Ian Munro
Publication year - 1974
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.409
H-Index - 60
eISSN - 1436-5057
pISSN - 0010-485X
DOI - 10.1007/bf02239502
Subject(s) - computation , combinatorics , matching (statistics) , mathematics , algorithm , graph , constant (computer programming) , discrete mathematics , computer science , statistics , programming language
This paper presents an algorithm which finds a maximum matching in a graph withn nodes andm edges within timek1mn+k2, wherek1 andk2 are constants. It is also shown that a maximum degree-constrained subgraph can be found within timek3m3+k4, wherek3 andk4, are constants. Use of random access computer is assumed in the computation of the time bounds.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom