FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL-TIME

被引：9
|
作者：
ICHIMORI, T [1 ]
ISHII, H [1 ]
NISHIDA, T [1 ]
机构：
[1] OSAKA UNIV,FAC ENGN,DEPT APPL PHYS,SUITA,OSAKA 565,JAPAN
来源：
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN | 1980年 / 23卷 / 03期
关键词：
D O I：
10.15807/jorsj.23.268
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：268 / 272
页数：5
相关论文
共 50 条
  • [21] Polynomial-time quantum algorithms for finding the linear structures of Boolean function
    WanQing Wu
    HuanGuo Zhang
    HouZhen Wang
    ShaoWu Mao
    Quantum Information Processing, 2015, 14 : 1215 - 1226
  • [22] Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game
    Chen, Jie
    Luo, Kaiyi
    Tang, Changbing
    Zhang, Zhao
    Li, Xiang
    IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2023, 10 (02) : 512 - 523
  • [23] Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game
    Jie Chen
    Kaiyi Luo
    Changbing Tang
    Zhao Zhang
    Xiang Li
    IEEE/CAA Journal of Automatica Sinica, 2023, 10 (02) : 512 - 523
  • [24] AN EXPLICIT SEPARATION OF RELATIVISED RANDOM POLYNOMIAL-TIME AND RELATIVISED DETERMINISTIC POLYNOMIAL-TIME
    ZIPPEL, R
    INFORMATION PROCESSING LETTERS, 1989, 33 (04) : 207 - 212
  • [25] A polynomial-time algorithm for the generalized independent-flow problem
    Eguchi, A
    Fujishige, S
    Takabatake, T
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2004, 47 (01) : 1 - 17
  • [26] A POLYNOMIAL-TIME ALGORITHM OF FINDING AUTOMORPHISM-GROUPS OF SHARPLY CONNECTED AUTOMATA
    LI, HL
    KEXUE TONGBAO, 1986, 31 (15): : 1014 - 1017
  • [27] FINDING THE PRIME FACTORS OF STRONG DIRECT-PRODUCT GRAPHS IN POLYNOMIAL-TIME
    FEIGENBAUM, J
    SCHAFFER, AA
    DISCRETE MATHEMATICS, 1992, 109 (1-3) : 77 - 102
  • [28] Parallel Polynomial-Time Approximation Scheme (PTAS) for Finding Compact Structural Motifs
    Brocka, Bernard
    Yap, Sharlene
    Clemente, Jhoirene
    2023 10TH INTERNATIONAL CONFERENCE ON BIOMEDICAL AND BIOINFORMATICS ENGINEERING, ICBBE 2023, 2023, : 73 - 79
  • [29] FINDING MINIMUM HEIGHT ELIMINATION TREES FOR INTERVAL-GRAPHS IN POLYNOMIAL-TIME
    ASPVALL, B
    HEGGERNES, P
    BIT NUMERICAL MATHEMATICS, 1994, 34 (04) : 484 - 509
  • [30] A polynomial-time algorithm for finding total colorings of partial k-trees
    Isobe, S
    Zhou, X
    Nishizeki, T
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1998, 1517 : 100 - 113
12345