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 条
  • [21] Algorithm for finding all k nearest neighbors
    Piegl, LA
    Tiller, W
    COMPUTER-AIDED DESIGN, 2002, 34 (02) : 167 - 172
  • [22] A Parallel algorithm for finding all the roots of a polynomial
    Jin, YM
    Zhang, SY
    COMPUTER SCIENCE AND TECHNOLOGY IN NEW CENTURY, 2001, : 479 - 482
  • [23] ALGORITHM FOR FINDING FEASIBILITY CONDITIONS OF MULTICOMMODITY FLOWS IN A NETWORK
    YATSUBOS.R
    HIRAYAMA, H
    ELECTRONICS & COMMUNICATIONS IN JAPAN, 1972, 55 (06): : 40 - 46
  • [24] An algorithm for unsteady viscous flows at all speeds
    Mary, I
    Sagaut, P
    Deville, M
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, 2000, 34 (05) : 371 - 401
  • [25] Study of simple algorithm for all speeds flows
    Zhang, Moujin
    Gu, Chuangang
    Miao, Yongmiao
    Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University, 1995, 29 (10): : 29 - 34
  • [26] A new efficient algorithm for finding all d-minimal cuts in multi-state networks
    Niu, Yi-Feng
    Gao, Zi-You
    Lam, William H. K.
    RELIABILITY ENGINEERING & SYSTEM SAFETY, 2017, 166 : 151 - 163
  • [27] An algorithm for finding a similar subgraph of all Hamiltonian cycles
    Wafdan, R.
    Ihsan, M.
    Suhaimi, D.
    1ST INTERNATIONAL CONFERENCE OF EDUCATION ON SCIENCES, TECHNOLOGY, ENGINEERING, AND MATHEMATICS (ICE-STEM), 2018, 948
  • [28] An optimal algorithm for finding all convex subsets in tournaments
    Wolf, MJ
    Haglin, DJ
    ARS COMBINATORIA, 1999, 52 : 173 - 179
  • [29] AN ALGORITHM FOR FINDING ALL THE K-COMPONENTS OF A DIGRAPH
    MAKINO, S
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 24 (3-4) : 213 - 221
  • [30] AN ALGORITHM FOR FINDING ALL EQUILIBRIA IN A MODEL OF A PARIMUTUEL SYSTEM
    IKEBE, Y
    WATANABE, T
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1994, 11 (01) : 79 - 92