A Novel Branching Strategy for Parameterized Graph Modification Problems

DOI10.1007/978-3-642-17461-2_27zbMath1310.68191arXiv1006.3020OpenAlexW2762561540WikidataQ56475006 ScholiaQ56475006MaRDI QIDQ3066469

James Nastos, Yong Gao

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.3020

zbMATH Keywords

cographsfixed-parameter tractabilitygraph modificationedge-deletionquasi-threshold graphsbounded search treetrivially perfect graphs

Mathematics Subject Classification ID

Trees (05C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

The cluster deletion problem for cographs ⋮ Complexity and parameterized algorithms for cograph editing ⋮ Edge deletion problems: branching facilitated by modular decomposition ⋮ An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs

This page was built for publication: A Novel Branching Strategy for Parameterized Graph Modification Problems