Publicação
How to solve the maximum matching problem determining (0,2)-regular sets
| Resumo: | 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. |
|---|---|
| Autores principais: | Pacheco, Maria F. |
| Outros Autores: | Cardoso, Domingos M.; Luz, Carlos J. |
| Assunto: | Maximum matching (0,2)-Regular sets |
| Ano: | 2014 |
| País: | Portugal |
| Tipo de documento: | documento de conferência |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Instituto Politécnico de Bragança |
| Idioma: | inglês |
| Origem: | Biblioteca Digital do IPB |
| Resumo: | 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. |
|---|