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 条

[1] The Simple Random Walk and max-Degree Walk on a Directed Graph
Montenegro, Ravi
RANDOM STRUCTURES & ALGORITHMS, 2009, 34 (03) : 395 - 407
[2] ON FINDING A SMALLEST AUGMENTATION TO BICONNECT A GRAPH - (EXTENDED ABSTRACT)
HSU, TS
RAMACHANDRAN, V
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 326 - 335
[3] Complexity of n-Queens Completion (Extended Abstract)
Gent, Ian P.
Jefferson, Christopher
Nightingale, Peter
PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 5608 - 5611
[4] Learning Low Degree Hypergraphs (Extended Abstract)
Balkanski, Eric
Hanguir, Oussama
Wang, Shatian
CONFERENCE ON LEARNING THEORY, VOL 178, 2022, 178 : 419 - 420
[5] Proofs and Certificates for Max-SAT (Extended Abstract)
Py, Matthieu
Cherif, Mohamed Sami
Habet, Djamal
PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 6942 - 6947
[6] Dual Space of a Lattice as the Completion of a Pervin Space Extended Abstract
Pin, Jean-Eric
RELATIONAL AND ALGEBRAIC METHODS IN COMPUTER SCIENCE, RAMICS 2017, 2017, 10226 : 24 - 40
[7] Computational Complexity of Iterated Maps on the Interval (Extended Abstract)
Spandl, Christoph
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (24): : 139 - 150
[8] A Core Method for the Weak Completion Semantics with Skeptical Abduction (Extended Abstract)
Saldanha, Emmanuelle-Anna Dietz
Hoelldobler, Steffen
Ramli, Carroline Dewi Puspa Kencana
Medinacelli, Luis Palacios
PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 6358 - 6361
[9] The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)
Francis, Mathew C.
Goncalves, Daniel
Ochem, Pascal
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2012, 7551 : 57 - 68
[10] Parallel maximum matching algorithms in interval graphs (extended abstract)
Chung, YJ
Park, K
Cho, YK
1997 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1997, : 602 - 609

← 1 2 3 →