Reoptimization of some maximum weight induced hereditary subgraph problems

DOI10.1007/978-3-642-29344-3_7MaRDI QIDQ2894455zbMATH OpenOpenAlexFDO

Authors Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos

Publication date 29 June 2012

Published in LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29344-3_7

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Reoptimization of maximum weight induced hereditary subgraph problems
• Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
• Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion
• Reoptimization of Weighted Graph and Covering Problems
• Algorithms and Computation

Cited in

(5)

• Reoptimization in machine scheduling
• Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
• Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion
• Reoptimization of Weighted Graph and Covering Problems
• Reoptimization of maximum weight induced hereditary subgraph problems

This page was built for publication: Reoptimization of some maximum weight induced hereditary subgraph problems

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