Determination of (0,2)-regular sets in graphs and applications
| Data(s) |
17/02/2016
17/02/2016
2015
|
|---|---|
| Resumo |
In this paper, relevant results about the determination of (k,t)-regular sets, using the main eigenvalues of a graph, are reviewed and some results about the determination of (0,2)-regular sets are introduced. An algorithm for that purpose is also described. As an illustration, this algorithm is applied to the determination of maximum matchings in arbitrary graphs. |
| Identificador |
978-3-319-20327-0 |
| Idioma(s) |
eng |
| Publicador |
Springer |
| Relação |
UID/MAT/04106/2013 Operational Research: IO 2013: XVI Congress of APDIO, Bragança, Portugal, June 3–5, 2013 http://dx.doi.org/10.1007/978-3-319-20328-7_7 |
| Direitos |
openAccess |
| Palavras-Chave | #Operational research #Combinatorial optimization |
| Tipo |
bookPart |
