Pages that link to "Item:Q687707"

The following pages link to The average performance of the greedy matching algorithm (Q687707):

Displaying 8 items.

• Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
• Finite size scaling for the core of large random hypergraphs (Q957528) (← links)
• \(q\)-distributions and Markov processes (Q1363655) (← links)
• Normal convergence problem? Two moments and a recurrence may be the clues (Q1578596) (← links)
• The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
• Surprising identities for the greedy independent set on Cayley trees (Q5049896) (← links)
• Greedy Matching in Bipartite Random Graphs (Q5084502) (← links)
• The average size of maximal matchings in graphs (Q6497032) (← links)