Incremental optimization of independent sets under the reconfiguration framework

Suppose that we are given an independent set I 0 of a graph G , and an integer l ≥ 0 . Then, we are asked to find an independent set of G having the maximum size among independent sets that are reachable from I 0 by either adding or removing a single vertex at a time such that all intermediate indep...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 43; číslo 5; s. 1264 - 1279
Hlavní autori:	Ito, Takehiro, Mizuta, Haruka, Nishimura, Naomi, Suzuki, Akira
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.07.2022 Springer Nature B.V
Predmet:	Algorithms Combinatorics Convex and Discrete Geometry Graphs Lower bounds Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Parameterization Parameters Reconfiguration Theory of Computation Combinatorial reconfiguration Independent set Graph algorithms
ISSN:	1382-6905, 1573-2886
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!