Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems

DOI10.1007/978-3-642-29344-3_7zbMath1297.68081OpenAlexW1574043371MaRDI QIDQ2894455

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

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

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

Related Items (1)

Reoptimization in machine scheduling

This page was built for publication: Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems