ESTiG - Resumos em Proceedings Não Indexados à WoS/Scopus
URI permanente para esta coleção:
Navegar
Percorrer ESTiG - Resumos em Proceedings Não Indexados à WoS/Scopus por assunto "(0,2)-Regular sets"
A mostrar 1 - 3 de 3
Resultados por página
Opções de ordenação
- Determination of (0,2)-regular sets in graphs and applicationsPublication . Pacheco, Maria F.; Cardoso, Domingos M.; Luz, Carlos J.A (k,tau)- regular set in a graph is a subset of vertices inducing a tau-regular subgraph and such that each vertex not in the set has exactly tau 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.
- Determination of (0,2)-regular sets in graphs and applicationsPublication . Pacheco, Maria F.; Cardoso, Domingos M.; Luz, Carlos J.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.
- How to solve the maximum matching problem determining (0,2)-regular setsPublication . Pacheco, Maria F.; Cardoso, Domingos M.; Luz, Carlos J.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.