Interval completion with the smallest max-degree - (Extended abstract)

被引：0
|
作者：
Fomin, FV
Golovach, PA
机构：
[1] St Petersburg State Univ, Fac Math & Mech, Dept Operat Res, St Petersburg 198904, Russia
[2] Syktyvkar State Univ, Dept Math Appl, Fac Math, Syktyvkar 167001, Russia
来源：
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 1998年 / 1517卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The interval degree of a graph is defined to be the smallest max-degree of any of its interval supergraphs. We find various bounds for this parameter. We prove that for any graph G the interval degree of G is at least the bandwidth of G, the pathwidth of G(2) and at most twice the bandwidth of G. Also we show that if G is an AT-free claw-free graph, then the interval degree of G is equal to the clique number of G(2) minus one. Finally, we show that there is a polynomial time algorithm for computing the interval degree of AT-free claw-free graphs.
引用
收藏
页码：359 / 371
页数：13
相关论文
共 27 条
  • [21] Characterizing minimal interval completions towards better understanding of profile and pathwidth - (Extended abstract)
    Heggernes, Pinar
    Suchan, Karol
    Todinca, Loan
    Villanger, Yngve
    STACS 2007, PROCEEDINGS, 2007, 4393 : 236 - +
  • [22] Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution [Extended Abstract]
    Im, Sungjin
    Shadloo, Maryam
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2790 - 2809
  • [23] Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution [Extended Abstract]
    Im, Sungjin
    Shadloo, Maryam
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2790 - 2809
  • [24] Successor-Invariant First-Order Logic on Classes of Bounded Degree (Extended Abstract)
    Grange, Julien
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 4775 - 4779
  • [25] Study of Extended Interval-valued Fuzzy Set and Application to Group Decision Consensus Degree
    Ju, Hongmei
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 5214 - 5216
  • [26] Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors - Extended abstract
    Reingold, O
    Vadhan, S
    Wigderson, A
    41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, : 3 - 13
  • [27] Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
    Bok, Jan
    Fiala, Jiri
    Jedlickova, Nikola
    Kratochvil, Jan
    Seifrtova, Michaela
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2023, 2023, 14093 : 101 - 115
123