共 50 条
- [34] Matching Algorithms Are Fast in Sparse Random Graphs Theory of Computing Systems, 2006, 39 : 3 - 14
- [35] On Unicyclic Graphs with Uniquely Restricted Maximum Matchings Graphs and Combinatorics, 2013, 29 : 1867 - 1879
- [38] Maximum Biplex Search over Bipartite Graphs 2022 IEEE 38TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2022), 2022, : 898 - 910
- [40] Maximum nullity and zero forcing of circulant graphs SPECIAL MATRICES, 2020, 8 (01): : 221 - 234