Dominating induced matchings for P 7-free graphs in linear time

Contributo in Atti di convegno
Data di Pubblicazione:
2011
Tipologia CRIS:
4.1 Contributo in Atti di convegno
Keywords:
dominating induced matching; efficient edge domination; linear time algorithm; P 7-free graphs; robust algorithm; Theoretical Computer Science; Computer Science (all)
Elenco autori:
Autori di Ateneo:
Link alla scheda completa:
https://ricerca.unich.it/handle/11564/691867
Titolo del libro:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pubblicato in:
LECTURE NOTES IN COMPUTER SCIENCE
Journal
LECTURE NOTES IN COMPUTER SCIENCE
Series