| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 570.81 KB | Adobe PDF |
Orientador(es)
Resumo(s)
A (K-1)-regular set in a graph is a subset of vertices such that each vertex in the set hask neighbours in it and each vertex not in the set has exactly i neighbours in it.
Descrição
Palavras-chave
Maximum matching (0,2)-Regular sets
Contexto Educativo
Citação
Pacheco, Maria F.; Cardoso, Domingos; Luz, Carlos (2014). How to solve the maximum matching problem determining (0,2)-regular sets. In XXX EURO mini Conference. Aveiro, Portugal