Publication
How to solve the maximum matching problem determining (0,2)-regular sets
| dc.contributor.author | Pacheco, Maria F. | |
| dc.contributor.author | Cardoso, Domingos M. | |
| dc.contributor.author | Luz, Carlos J. | |
| dc.date.accessioned | 2018-04-30T08:34:47Z | |
| dc.date.available | 2018-04-30T08:34:47Z | |
| dc.date.issued | 2014 | |
| dc.description.abstract | 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. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.citation | Pacheco, Maria F.; Cardoso, Domingos; Luz, Carlos (2014). How to solve the maximum matching problem determining (0,2)-regular sets. In XXX EURO mini Conference. Aveiro, Portugal | pt_PT |
| dc.identifier.uri | http://hdl.handle.net/10198/17415 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | yes | pt_PT |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | pt_PT |
| dc.subject | Maximum matching | pt_PT |
| dc.subject | (0,2)-Regular sets | pt_PT |
| dc.title | How to solve the maximum matching problem determining (0,2)-regular sets | pt_PT |
| dc.type | conference object | |
| dspace.entity.type | Publication | |
| oaire.citation.conferencePlace | Aveiro, Portugal | pt_PT |
| oaire.citation.title | XXX EURO mini Conference | pt_PT |
| person.familyName | Pacheco | |
| person.givenName | Maria F. | |
| person.identifier.ciencia-id | F319-DAC3-8F15 | |
| person.identifier.orcid | 0000-0001-7915-0391 | |
| person.identifier.scopus-author-id | 36802474600 | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | conferenceObject | pt_PT |
| relation.isAuthorOfPublication | e56596ca-3238-4fde-ace1-abb363a222e8 | |
| relation.isAuthorOfPublication.latestForDiscovery | e56596ca-3238-4fde-ace1-abb363a222e8 |