We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some reductions presented in the literature, mostly in the context of claw-free graphs. We show that these reductions can be embedded in a simple algorithm that in at most jE(G)j steps builds a new graph G0 such that G0 has no proper and homogeneous pairs of cliques, and G and G0 agree on the value of some relevant invariant (or property).
Faenza, Y., Oriolo, G., & Snels, C. (2010). A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) [Working paper].
Tipologia: | Altro |
Citazione: | Faenza, Y., Oriolo, G., & Snels, C. (2010). A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) [Working paper]. |
Lingua: | English |
Settore Scientifico Disciplinare: | Settore ING-IND/35 - Ingegneria Economico-Gestionale |
DCMI: | Working paper |
Rilevanza: | Rilevanza internazionale |
Data di pubblicazione: | 2010 |
Titolo: | A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) |
Autori: | Faenza, Y; Oriolo, G; Snels, C |
Autori: | |
Appare nelle tipologie: | 99 - Altro |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
RR-15.10.pdf | Full text | N/A | Open Access Visualizza/Apri | |
frontespizio_15.pdf | Titlepage | N/A | Open Access Visualizza/Apri |