A POLYNOMIAL CHARACTERIZATION OF SOME GRAPH PARTITIONING PROBLEMS

被引:7
|
作者
ARBIB, C [1 ]
机构
[1] UNIV LA SAPIENZA,DIPARTIMENTO INFORMAT & SISTEMIST,I-00184 ROMA,ITALY
关键词
D O I
10.1016/0020-0190(88)90144-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:223 / 230
页数:8
相关论文
共 50 条
  • [1] Polynomial observables in the graph partitioning problem
    Marchisio, MA
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2001, 12 (01): : 13 - 18
  • [2] A Polynomial Algorithm for Partitioning Problems
    Tahaee, Seyed-Abdoreza
    Jahangir, Amir Hossein
    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2010, 9 (04)
  • [3] A polynomial algorithm for balanced clustering via graph partitioning
    Evaristo Caraballo, Luis
    Diaz-Banez, Jose-Miguel
    Kroher, Nadine
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (02) : 456 - 469
  • [4] Parameterized Algorithms for Graph Partitioning Problems
    Hadas Shachnai
    Meirav Zehavi
    Theory of Computing Systems, 2017, 61 : 721 - 738
  • [5] Path optimization for graph partitioning problems
    Berry, JW
    Goldberg, MK
    DISCRETE APPLIED MATHEMATICS, 1999, 90 (1-3) : 27 - 50
  • [6] The price of connectedness in graph partitioning problems
    Martin, Nicolas
    Frasca, Paolo
    Ishizaki, Takayuki
    Imura, Jun-Ichi
    Canudas-de-Wit, Carlos
    2019 18TH EUROPEAN CONTROL CONFERENCE (ECC), 2019, : 2313 - 2318
  • [7] ANALYSIS OF A CLASS OF GRAPH PARTITIONING PROBLEMS
    BERTOLAZZI, P
    LUCERTINI, M
    SPACCAMELA, AM
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1982, 16 (03): : 255 - 261
  • [8] EXPECTED COMPLEXITY OF GRAPH PARTITIONING PROBLEMS
    KUCERA, L
    DISCRETE APPLIED MATHEMATICS, 1995, 57 (2-3) : 193 - 212
  • [9] Parameterized Algorithms for Graph Partitioning Problems
    Shachnai, Hadas
    Zehavi, Meirav
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2014, 8747 : 384 - 395
  • [10] Parameterized Algorithms for Graph Partitioning Problems
    Shachnai, Hadas
    Zehavi, Meirav
    THEORY OF COMPUTING SYSTEMS, 2017, 61 (03) : 721 - 738