ON AN ALGORITHM OF FINDING ALL FLOWS IN NETWORKS

被引:0
|
作者
IVANCHEV, DT
机构
来源
关键词
D O I
暂无
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
引用
收藏
页码:753 / 756
页数:4
相关论文
共 50 条
  • [1] AN EFFICIENT ALGORITHM FOR FINDING MULTICOMMODITY FLOWS IN PLANAR NETWORKS
    MATSUMOTO, K
    NISHIZEKI, T
    SAITO, N
    SIAM JOURNAL ON COMPUTING, 1985, 14 (02) : 289 - 302
  • [2] An efficient distributed algorithm for finding all hinge vertices in networks
    Ho, TY
    Chang, JM
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2005, 82 (07) : 821 - 827
  • [3] A NEW ALGORITHM FOR FINDING ALL MINIMAL CUTS IN MODIFIED NETWORKS
    Yeh, Wei-Chang
    Ho, Hsiao-Chang
    Chen, Yi-Chun
    Yeh, Yuan-Ming
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2012, 8 (1A): : 419 - 430
  • [4] O(V3) ALGORITHM FOR FINDING MAXIMUM FLOWS IN NETWORKS
    MALHOTRA, VM
    KUMAR, MP
    MAHESHWARI, SN
    INFORMATION PROCESSING LETTERS, 1978, 7 (06) : 277 - 278
  • [5] A SIMPLE ALGORITHM FOR FINDING ALL SOLUTIONS OF PIECEWISE-LINEAR NETWORKS
    HUANG, Q
    LIU, RW
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1989, 36 (04): : 600 - 609
  • [6] A PRIMAL ALGORITHM FOR FINDING MINIMUM-COST FLOWS IN CAPACITATED NETWORKS WITH APPLICATIONS
    MONMA, CL
    SEGAL, M
    BELL SYSTEM TECHNICAL JOURNAL, 1982, 61 (06): : 949 - 968
  • [7] Sink Toward Source Algorithm Finding Maximal Flows on Extended Mixed Networks
    Viet Tran Ngoc
    Hung Hoang Bao
    Chien Tran Quoc
    Thanh Le Manh
    Van Hoang Thi Khanh
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS, ACIIDS 2016, PT II, 2016, 9622 : 253 - 260
  • [8] Finding all minimum cost flows and a faster algorithm for the K best flow problem
    Konen, David
    Schmidt, Daniel
    Spisla, Christiane
    DISCRETE APPLIED MATHEMATICS, 2022, 321 : 333 - 349
  • [9] Finding elephant flows for optical networks
    Fioreze, Tiago
    Wolbers, Mattijs Oude
    van de Meent, Remco
    Pras, Aiko
    2007 10TH IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM 2009), VOLS 1 AND 2, 2007, : 627 - +
  • [10] An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks
    Hadid, Rachid
    Karaata, Mehmet Hakan
    COMPUTER COMMUNICATIONS, 2009, 32 (05) : 858 - 866