共 50 条
- [41] DETERMINANTAL SPANNING FORESTS ON PLANAR GRAPHS ANNALS OF PROBABILITY, 2019, 47 (02): : 952 - 988
- [42] Finding the Minimum Cut Set in Attack Graphs Using Genetic Algorithms 2013 INTERNATIONAL CONFERENCE ON COMPUTER APPLICATIONS TECHNOLOGY (ICCAT), 2013,
- [43] ALGORITHMS FOR FINDING NONCROSSING PATHS WITH MINIMUM TOTAL LENGTH IN PLANE GRAPHS ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1995, 78 (04): : 1 - 15
- [44] Algorithms for finding noncrossing paths with minimum total length in plane graphs Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi), 1995, 78 (04): : 1 - 15
- [47] Induced graphs of uniform spanning forests ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, 2020, 56 (04): : 2732 - 2744
- [48] ALGORITHMS OF MINIMUM FORESTS COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1972, 274 (16): : 1212 - +
- [49] Morphology on Graphs and Minimum Spanning Trees MATHEMATICAL MORPHOLOGY AND ITS APPLICATION TO SIGNAL AND IMAGE PROCESSING, 2009, 5720 : 161 - 170
- [50] Minimum Spanning Trees in Temporal Graphs SIGMOD'15: PROCEEDINGS OF THE 2015 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2015, : 419 - 430