The following pages link to STACS 2004 (Q5309689):
Displaying 10 items.
- Improved induced matchings in sparse graphs (Q608287) (← links)
- A Las Vegas RNC algorithm for maximum matching (Q1103637) (← links)
- Matching algorithms are fast in sparse random graphs (Q2432523) (← links)
- Push is Fast on Sparse Random Graphs (Q2953404) (← links)
- Maximum matchings in general graphs through randomization (Q3031945) (← links)
- A Fast Perfect-Matching Algorithm in Random Graphs (Q3360222) (← links)
- Fractional Matching Via Balls-and-Bins (Q3595378) (← links)
- Randomized greedy matching. II (Q4322476) (← links)
- Average-case analysis of algorithms for matchings and related problems (Q4327634) (← links)
- Finding maximum matchings in random regular graphs in linear expected time (Q6049997) (← links)