Open AccessThe Computational Complexity of Weighted Greedy Matching
Author(s) -
Argyrios Deligkas,
George B. Mertzios,
Paul G. Spirakis
Publication year - 2017
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v31i1.10561
Subject(s) - cardinality (data modeling) , combinatorics , mathematics , bipartite graph , matching (statistics) , conjecture , approximation algorithm , greedy algorithm , discrete mathematics , computational complexity theory , parameterized complexity , graph , algorithm , computer science , data mining , statistics
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