Controllability and matchings in random bipartite graphs
From MaRDI portal
Publication:3179073
Recommendations
- Controllability, matching ratio and graph convergence
- On a Conjecture of Godsil Concerning Controllable Random Graphs
- Matchings in random biregular bipartite graphs
- Further results on almost controllable graphs
- Controllability of undirected graphs
- Further results on controllable graphs
- Optimality of Fast-Matching Algorithms for Random Networks With Applications to Structural Controllability
- Greedy matching in bipartite random graphs
- The controllability of graphs with diameter \(0-2\)
- Controllability of NEPSes of graphs
Cited in
(10)- Zero forcing number, constrained matchings and strong structural controllability
- Towards an optimal contention resolution scheme for matchings
- On a Conjecture of Godsil Concerning Controllable Random Graphs
- Finding maximum matchings in random regular graphs in linear expected time
- Maximum matchings in a pseudofractal scale-free web
- Karp-Sipser on random graphs with a fixed degree sequence
- Controllability, matching ratio and graph convergence
- Adversarial resilience of matchings in bipartite random graphs
- Maximum matchings in scale-free networks with identical degree distribution
- The matching process and independent process in random regular graphs and hypergraphs
This page was built for publication: Controllability and matchings in random bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179073)