Declawing a graph: polyhedra and Branch-and-Cut algorithms

Felipe C. Fragoso (), Gilberto F. Sousa Filho () and Fábio Protti ()
Additional contact information
Felipe C. Fragoso: Universidade Federal da Paraíba (UFPB)
Gilberto F. Sousa Filho: Universidade Federal da Paraíba (UFPB)
Fábio Protti: Universidade Federal Fluminense (UFF)

Journal of Combinatorial Optimization, 2021, vol. 42, issue 1, No 6, 85-124

Abstract: Abstract The complete bipartite graph $$K_{1,3}$$ K 1 , 3 is called a claw. A graph is said to be claw-free if it contains no induced subgraph isomorphic to a claw. Given a graph G, the NP-hard Graph Declawing Problem (GDP) consists of finding a minimum set $$S\subseteq V(G)$$ S ⊆ V ( G ) such that $$G-S$$ G - S is claw-free. This work develops a polyhedral study of the GDP polytope, expliciting its full dimensionality, proposing and testing five families of facets: trivial inequalities, claw inequalities, star inequalities, lantern inequalities, and binary star inequalities. In total, four Branch-and-Cut algorithms with separation heuristics have been developed to test the computational benefits of each proposed family on random graph instances and random interval graph instances. Our results show that the model that uses a separation heuristics proposed for star inequalities achieves better results on both set of instances in almost all cases.

Keywords: Graph declawing problem; Claw-free graphs; Branch-and-cut; Polyhedral combinatorics (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00736-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:42:y:2021:i:1:d:10.1007_s10878-021-00736-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00736-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().