A MIN-MAX THEOREM FOR GRAPHS WITH APPLICATION TO GRAPH COLORING

被引：0
|
作者：
MATULA, DW
机构：
来源：
SIAM REVIEW | 1968年 / 10卷 / 04期
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：481 / &
相关论文
共 50 条
  • [41] Tabu search for min-max edge crossing in graphs
    Pastore, Tommaso
    Martinez-Gavara, Anna
    Napoletano, Antonio
    Festa, Paola
    Marti, Rafael
    COMPUTERS & OPERATIONS RESEARCH, 2020, 114 (114)
  • [42] Heuristics for the min-max arc crossing problem in graphs
    Marti, Rafael
    Campos, Vicente
    Hoff, Arild
    Peird, Juanjo
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 109 : 100 - 113
  • [43] Min-max communities in graphs: Complexity and computational properties
    Di Ianni, Miriam
    Gambosi, Giorgio
    Rossi, Gianluca
    Vocca, Paola
    THEORETICAL COMPUTER SCIENCE, 2016, 613 : 94 - 114
  • [44] MIN-MAX RELATIONS FOR ODD CYCLES IN PLANAR GRAPHS
    Kral, Daniel
    Sereni, Jean-Sebastien
    Stacho, Ladislav
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (03) : 884 - 895
  • [45] Min-Max Graph Partitioning and Small Set Expansion
    Bansal, Nikhil
    Feige, Uriel
    Krauthgamer, Robert
    Makarychev, Konstantin
    Nagarajan, Viswanath
    Naor, Joseph
    Schwartz, Roy
    2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 17 - 26
  • [46] Min-Max Spaces and Complexity Reduction in Min-Max Expansions
    Gaubert, Stephane
    McEneaney, William M.
    APPLIED MATHEMATICS AND OPTIMIZATION, 2012, 65 (03): : 315 - 348
  • [47] Min-max cover of a graph with a small number of parts
    Farbstein, Boaz
    Levin, Asaf
    DISCRETE OPTIMIZATION, 2015, 16 : 51 - 61
  • [48] MIN-MAX GRAPH PARTITIONING AND SMALL SET EXPANSION
    Bansal, Nikhil
    Feige, Uriel
    Krauthgamer, Robert
    Makarychev, Konstantin
    Nagarajan, Viswanath
    Naor, Joseph
    Schwartz, Roy
    SIAM JOURNAL ON COMPUTING, 2014, 43 (02) : 872 - 904
  • [49] Graph contrastive learning with min-max mutual information
    Xu, Yuhua
    Wang, Junli
    Guang, Mingjian
    Yan, Chungang
    Jiang, Changjun
    INFORMATION SCIENCES, 2024, 665
  • [50] Complexity of the min-max and min-max regret assignment problems
    Aissi, H
    Bazgan, C
    Vanderpooten, D
    OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 634 - 640
12345