Login / Signup
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs
Martin Dietzfelbinger
Hendrik Peilke
Michael Rink
Published in:
CoRR (2012)
Keyphrases
</>
greedy heuristic
random graphs
greedy algorithm
np hard
graph theoretic
phase transition
learning curves
minimum weight
small world
knapsack problem
undirected graph
lower bound
worst case analysis
complex networks
optimal solution
power law
special case
attributed graphs
constraint satisfaction
input image