Independent set under a change constraint from an initial solution

DOI10.1007/978-3-031-30448-4_4MaRDI QIDQ6057312zbMATH OpenFDO

Authors Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue

Publication date 4 October 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-30448-4_4

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A characterisation of rigid circuit graphs
• Algorithmic graph theory and perfect graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Algorithms on circular-arc graphs
• An optimal greedy heuristic to color interval graphs
• Computing independent sets in graphs with large girth
• Domination on Cocomparability Graphs
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 3445275 (Why is no real title available?)
• Incremental network optimization: theory and algorithms
• Modular decomposition and transitive orientation
• Parameterized algorithms
• Reducibility among combinatorial problems
• Some simplified NP-complete graph problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The complexity of comparability graph recognition and coloring
• The ellipsoid method and its consequences in combinatorial optimization
• The intersection graphs of subtrees in trees are exactly the chordal graphs

This page was built for publication: Independent set under a change constraint from an initial solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057312)