The complexity of cluster vertex splitting and company

被引：0
|
作者：
TU Wien, Vienna, Austria [1 ]
机构：
来源：
Discrete Appl Math | 2025年 / 365卷
关键词：
Supported by the Vienna Science and Technology Fund (WWTF); Austria under grant 10.47379/ICT22029.Supported by the Vienna Science and Technology Fund (WWTF); Austria under grant 10.47379/ICT19035.Partly supported by the Alexander von Humboldt Foundation;
D O I：
10.1016/j.dam.2025.01.012
中图分类号：
学科分类号：
摘要：
44
引用
收藏
页码：190 / 207
相关论文
共 50 条
  • [21] CLUSTER ALGORITHM FOR VERTEX MODELS
    EVERTZ, HG
    LANA, G
    MARCU, M
    PHYSICAL REVIEW LETTERS, 1993, 70 (07) : 875 - 879
  • [22] Complexity of approximating the vertex centroid of a polyhedron
    Elbassioni, Khaled
    Tiwary, Hans Raj
    THEORETICAL COMPUTER SCIENCE, 2012, 421 : 56 - 61
  • [23] The Complexity of Degree Anonymization by Vertex Addition
    Bredereck, Robert
    Froese, Vincent
    Hartung, Sepp
    Nichterlein, Andre
    Niedermeier, Rolf
    Talmon, Nimrod
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2014, 2014, 8546 : 44 - 55
  • [24] The complexity of degree anonymization by vertex addition
    Bredereck, Robert
    Froese, Vincent
    Hartung, Sepp
    Nichterlein, Andre
    Niedermeier, Rolf
    Talmon, Nimrod
    THEORETICAL COMPUTER SCIENCE, 2015, 607 : 16 - 34
  • [25] On the complexity of the balanced vertex ordering problem
    Kara, Jan
    Kratochvil, Jan
    Wood, David R.
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2007, 9 (01): : 193 - 202
  • [26] On the Complexity of Singly Connected Vertex Deletion
    Das, Avinandan
    Kanesh, Lawqueen
    Madathil, Jayakrishnan
    Muluk, Komal
    Purohit, Nidhi
    Saurabh, Saket
    COMBINATORIAL ALGORITHMS, IWOCA 2020, 2020, 12126 : 237 - 250
  • [27] On the Parameterized Complexity of Happy Vertex Coloring
    Agrawal, Akanksha
    COMBINATORIAL ALGORITHMS, IWOCA 2017, 2018, 10765 : 103 - 115
  • [28] On the Complexity of Digraph Colourings and Vertex Arboricity
    Hochstaettler, Winfried
    Schroeder, Felix
    Steiner, Raphael
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2020, 22 (01):
  • [29] On the complexity of singly connected vertex deletion
    Das, Avinandan
    Kanesh, Lawqueen
    Madathil, Jayakrishnan
    Muluk, Komal
    Purohit, Nidhi
    Saurabh, Saket
    THEORETICAL COMPUTER SCIENCE, 2022, 934 : 47 - 64
  • [30] Parameterized Complexity of Vertex Cover Variants
    Jiong Guo
    Rolf Niedermeier
    Sebastian Wernicke
    Theory of Computing Systems, 2007, 41 : 501 - 520
12345