Determination of (0,2)-regular sets in graphs and applications
A (k,τ)-regular set in a graph is a subset of vertices inducing a k-regular subgraph and such that each vertex not in the set has exactly τ neighbours in it. We will present a new algorithm for the determination of (0,2)-regular sets as well as its application to the determination of maximum matchin...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferenceObject |
| Idioma: | por |
| Publicado em: |
2014
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10198/10762 |
| País: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/10762 |