Author:
Dai Yang,Iwano Kazuo,Katoh Naoki
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference11 articles.
1. Infinitesimal Calculus;Dieudonne,1971
2. A new unified approximate approach to the minimum cut problem and its variants using minimum range cut algorithms;Dai;IBM Research Rept., RT0082,1992
3. A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
4. The solution of some random NP-hard problems in polynomial expected time;Dyer;J. Algorithms,1989
5. A matroid approach to finding edge connectivity and packing arborescences;Gabow,1991
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Key Section Search Method Based on Key Branches;2024 IEEE 2nd International Conference on Control, Electronics and Computer Technology (ICCECT);2024-04-26
2. On the Structure of Contractible Edges in k-connected Partial k-trees;Graphs and Combinatorics;2009-11