Independent set under a change constraint from an initial solution

DOI10.1007/978-3-031-30448-4_4MaRDI QIDQ6057312

Eiji Miyano, Hiroshi Eto, Reo Nonoue, Guo-Hui Lin, Yuichi Asahiro, Kana Korenaga

Publication date: 4 October 2023

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal greedy heuristic to color interval graphs
• The ellipsoid method and its consequences in combinatorial optimization
• Computing independent sets in graphs with large girth
• Some simplified NP-complete graph problems
• The complexity of comparability graph recognition and coloring
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Modular decomposition and transitive orientation
• A characterisation of rigid circuit graphs
• Algorithmic graph theory and perfect graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Incremental Network Optimization: Theory and Algorithms
• Domination on Cocomparability Graphs
• Algorithms on circular-arc graphs
• Reducibility among Combinatorial Problems
• Parameterized Algorithms
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

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