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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 43; no. 5; pp. 1264 - 1279
Main Authors:	Ito, Takehiro, Mizuta, Haruka, Nishimura, Naomi, Suzuki, Akira
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2022 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!