Author(s): Pacheco, Maria F. ; Cardoso, Domingos M. ; Luz, Carlos J.
Date: 2013
Persistent ID: http://hdl.handle.net/10198/10762
Origin: Biblioteca Digital da UPB
Subject(s): Maximum matching; Main eigenvalues; (0,2)-Regular sets
Document details
Determination of (0,2)-regular sets in graphs and applications
Description
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 matchings in arbitrary graphs.
Document Type
Conference object
Language Portuguese
Contributor(s) Biblioteca Digital da UPB
Language Portuguese
Contributor(s) Biblioteca Digital da UPB
