Critical and maximum independent sets revisited

Vadim E. Levit; Eugen Mandrescu

doi:10.1007/978-3-030-22629-9_1

Critical and maximum independent sets revisited

Vadim E. Levit
, Eugen Mandrescu

Ariel University
Holon Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Let G be a simple graph with vertex set V(G). A set (formula presented) is independent if no two vertices from S are adjacent, and by (formula presented) we mean the family of all independent sets of G. The number (formula presented) is the difference of (formula presented), and a set (formula presented) is critical if (formula presented) [34]. Let us recall the following definitions: (formula presented) [16],(formula presented) [5],(formula presented) [18],(formula presented) [12](formula presented) [24]. In this paper we focus on interconnections between (formula presented), core, corona, (formula presented), and diadem.

Original language	English
Title of host publication	Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings
Editors	Michael Khachay, Yury Kochetov, Panos Pardalos
Publisher	Springer Verlag
Pages	3-18
Number of pages	16
ISBN (Print)	9783030226282
DOIs	https://doi.org/10.1007/978-3-030-22629-9_1
State	Published - 2019
Externally published	Yes
Event	18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 - Ekaterinburg, Russian Federation Duration: 8 Jul 2019 → 12 Jul 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11548 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019
Country/Territory	Russian Federation
City	Ekaterinburg
Period	8/07/19 → 12/07/19

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2019.

Keywords

Core
Corona
Critical set
Diadem
Independent set
Ker
Matching

Access to Document

10.1007/978-3-030-22629-9_1

Cite this

Levit, V. E., & Mandrescu, E. (2019). Critical and maximum independent sets revisited. In M. Khachay, Y. Kochetov, & P. Pardalos (Eds.), Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings (pp. 3-18). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11548 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-22629-9_1

Levit, Vadim E. ; Mandrescu, Eugen. / Critical and maximum independent sets revisited. Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings. editor / Michael Khachay ; Yury Kochetov ; Panos Pardalos. Springer Verlag, 2019. pp. 3-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2d1d30275784438a8e7a264de477c3ce,

title = "Critical and maximum independent sets revisited",

abstract = "Let G be a simple graph with vertex set V(G). A set (formula presented) is independent if no two vertices from S are adjacent, and by (formula presented) we mean the family of all independent sets of G. The number (formula presented) is the difference of (formula presented), and a set (formula presented) is critical if (formula presented) [34]. Let us recall the following definitions: (formula presented) [16],(formula presented) [5],(formula presented) [18],(formula presented) [12](formula presented) [24]. In this paper we focus on interconnections between (formula presented), core, corona, (formula presented), and diadem.",

keywords = "Core, Corona, Critical set, Diadem, Independent set, Ker, Matching",

author = "Levit, \{Vadim E.\} and Eugen Mandrescu",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 ; Conference date: 08-07-2019 Through 12-07-2019",

year = "2019",

doi = "10.1007/978-3-030-22629-9\_1",

language = "אנגלית",

isbn = "9783030226282",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "3--18",

editor = "Michael Khachay and Yury Kochetov and Panos Pardalos",

booktitle = "Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings",

address = "גרמניה",

}

Levit, VE & Mandrescu, E 2019, Critical and maximum independent sets revisited. in M Khachay, Y Kochetov & P Pardalos (eds), Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11548 LNCS, Springer Verlag, pp. 3-18, 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019, Ekaterinburg, Russian Federation, 8/07/19. https://doi.org/10.1007/978-3-030-22629-9_1

Critical and maximum independent sets revisited. / Levit, Vadim E.; Mandrescu, Eugen.
Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings. ed. / Michael Khachay; Yury Kochetov; Panos Pardalos. Springer Verlag, 2019. p. 3-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11548 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Critical and maximum independent sets revisited

AU - Levit, Vadim E.

AU - Mandrescu, Eugen

N1 - Publisher Copyright: © Springer Nature Switzerland AG 2019.

PY - 2019

Y1 - 2019

N2 - Let G be a simple graph with vertex set V(G). A set (formula presented) is independent if no two vertices from S are adjacent, and by (formula presented) we mean the family of all independent sets of G. The number (formula presented) is the difference of (formula presented), and a set (formula presented) is critical if (formula presented) [34]. Let us recall the following definitions: (formula presented) [16],(formula presented) [5],(formula presented) [18],(formula presented) [12](formula presented) [24]. In this paper we focus on interconnections between (formula presented), core, corona, (formula presented), and diadem.

AB - Let G be a simple graph with vertex set V(G). A set (formula presented) is independent if no two vertices from S are adjacent, and by (formula presented) we mean the family of all independent sets of G. The number (formula presented) is the difference of (formula presented), and a set (formula presented) is critical if (formula presented) [34]. Let us recall the following definitions: (formula presented) [16],(formula presented) [5],(formula presented) [18],(formula presented) [12](formula presented) [24]. In this paper we focus on interconnections between (formula presented), core, corona, (formula presented), and diadem.

KW - Core

KW - Corona

KW - Critical set

KW - Diadem

KW - Independent set

KW - Ker

KW - Matching

UR - https://www.scopus.com/pages/publications/85067663642

U2 - 10.1007/978-3-030-22629-9_1

DO - 10.1007/978-3-030-22629-9_1

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85067663642

SN - 9783030226282

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 3

EP - 18

BT - Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings

A2 - Khachay, Michael

A2 - Kochetov, Yury

A2 - Pardalos, Panos

PB - Springer Verlag

T2 - 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019

Y2 - 8 July 2019 through 12 July 2019

ER -

Levit VE, Mandrescu E. Critical and maximum independent sets revisited. In Khachay M, Kochetov Y, Pardalos P, editors, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings. Springer Verlag. 2019. p. 3-18. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-22629-9_1

Critical and maximum independent sets revisited

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this