Search results for "maximum cardinality matchings"

Found 9 publication records. Showing 9 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Oliver Giel, Ingo Wegener	Maximum cardinality matchings on trees by randomized local search.	GECCO	2006	DBLP DOI BibTeX RDF	maximum cardinality matchings, randomized local search, evolutionary algorithms, runtime analysis
2	Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee	Parallel algorithms for maximum matching in interval graphs. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	disjoint intervals, maximum cardinality matchings, hypercube model, unsorted input, sorted input, optimal sequential algorithms, parallel algorithms, parallel algorithms, computational complexity, graph theory, hypercube networks, processors, computation time, interval graphs, maximum matching, EREW PRAM, EREW PRAM model
1	Prasad Chebolu, Alan M. Frieze, Páll Melsted	Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time.	ICALP	2008	DBLP DOI BibTeX RDF
1	Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis	Space Efficient Hash Tables with Worst Case Constant Access Time.	STACS	2003	DBLP DOI BibTeX RDF
1	John D. Kececioglu, A. Justin Pecqueur	Computing Maximum-Cardinality Matchings in Sparse General Graphs.	Algorithm Engineering	1998	DBLP BibTeX RDF
1	Thomas Brunn, Bernhard Möller, Martin Russling	Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach.	MPC	1998	DBLP BibTeX RDF
1	Feodor F. Dragan	On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract).	WG	1997	DBLP DOI BibTeX RDF
1	Thomas H. Spencer	Parallel matching on expanders.	SPDP	1991	DBLP DOI BibTeX RDF
1	Galen H. Sasaki, Bruce Hajek	The time complexity of maximum matching by simulated annealing.	J. ACM	1988	DBLP DOI BibTeX RDF

Displaying result #1 - #9 of 9 (100 per page; Change: )