1-APPROXIMATION ALGORITHM FOR BOTTLENECK DISJOINT PATH MATCHING

被引：7
作者：
DATTA, AK
SEN, RK
机构：
[1] INDIAN INST TECHNOL,DEPT COMP SCI & ENGN,KHARAGPUR 721302,W BENGAL,INDIA
[2] BENGAL ENGN COLL,DEPT COMP SCI & TECHNOL,SIBPUR 711103,INDIA
来源：
INFORMATION PROCESSING LETTERS | 1995年 / 55卷 / 01期
关键词：
ALGORITHMS; APPROXIMATION ALGORITHMS; GRAPH; MATCHING; PATH MATCHING;
D O I：
10.1016/0020-0190(95)00031-7
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
[No abstract available]
引用
收藏
页码：41 / 44
页数：4
相关论文
共 11 条
  • [1] CHONG KW, 1992, P S DISCRETE ALGORIT
  • [2] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES
    EDMONDS, J
    [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2): : 125 - +
  • [3] Gabow H. N., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P347, DOI 10.1109/SFCS.1984.715935
  • [4] GABOW HN, 1986, COMBINATORICA, P109
  • [5] GABOW HN, J ACM, V23, P221
  • [6] AN O(EVLOGV) ALGORITHM FOR FINDING A MAXIMAL WEIGHTED MATCHING IN GENERAL GRAPHS
    GALIL, Z
    MICALI, S
    GABOW, H
    [J]. SIAM JOURNAL ON COMPUTING, 1986, 15 (01) : 120 - 130
  • [7] Harary F, 1969, GRAPH THEORY
  • [8] Johnson D. B., 1992, SPAA '92. 4th Annual ACM Symposium on Parallel Algorithms and Architectures, P363, DOI 10.1145/140901.141917
  • [9] LAWLEW EL, COMBINATORIAL OPTIMI
  • [10] AN O(LOG N) PARALLEL CONNECTIVITY ALGORITHM
    SHILOACH, Y
    VISHKIN, U
    [J]. JOURNAL OF ALGORITHMS, 1982, 3 (01) : 57 - 67
12