Pages that link to "Item:Q3179073"
From MaRDI portal
The following pages link to Controllability and matchings in random bipartite graphs (Q3179073):
Displaying 9 items.
- Zero forcing number, constrained matchings and strong structural controllability (Q491112) (← links)
- Adversarial resilience of matchings in bipartite random graphs (Q501985) (← links)
- Maximum matchings in scale-free networks with identical degree distribution (Q528496) (← links)
- The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
- Controllability, matching ratio and graph convergence (Q2421302) (← links)
- On a Conjecture of Godsil Concerning Controllable Random Graphs (Q2953321) (← links)
- Karp–Sipser on Random Graphs with a Fixed Degree Sequence (Q3103622) (← links)
- MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB (Q5086261) (← links)
- Finding maximum matchings in random regular graphs in linear expected time (Q6049997) (← links)