共 50 条
- [31] A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges Journal of Graph Algorithms and Applications, 2022, 26 (04): : 577 - 588
- [33] PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 12 : 284 - 290
- [35] EFFICIENT ALGORITHMS FOR FINDING MAXIMUM MATCHING IN GRAPHS. Computing surveys, 1986, 18 (01): : 23 - 38
- [36] Vertex-driven parallel minimum spanning tree algorithms on large graphs 1600, Science Press (51):
- [38] Efficient algorithms for the minimum connected domination on trapezoid graphs COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 126 - 136