Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/131206COMPARTIR / EXPORTAR:
 SHARE
 CORE
BASE
|
|
| Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
| Título: | Approximating degree sequences with regular graphic sequences (Extended Abstract) |
Autor: | Salas, Julian; Torra, Vicenç CSIC ORCID | Palabras clave: | Graph distance Edit distance Edge rotation distance Degree sequences distance K-Anonymity |
Fecha de publicación: | 2014 | Editor: | Elsevier | Citación: | Electronic Notes in Discrete Mathematics 46: 273- 280 (2014) | Resumen: | We study conditions to approximate the degree sequence of a given graph by a regular one. We obtain optimal conditions for a few metrics such as the edge rotation distance for graphs, the rectilinear and Euclidean distances over degree sequences. When we require the approximation to have at least k copies of each value in the degree sequence, that is, each value d in the degree sequence appears at least k times, the problem has a direct application in the context of data privacy when k-anonymity is required. © 2014 Elsevier B.V. | URI: | http://hdl.handle.net/10261/131206 | DOI: | 10.1016/j.endm.2014.08.036 | Identificadores: | doi: 10.1016/j.endm.2014.08.036 issn: 1571-0653 |
| Aparece en las colecciones: | (IIIA) Artículos |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| accesoRestringido.pdf | 15,38 kB | Adobe PDF |  Visualizar/Abrir |
CORE Recommender
Page view(s)
265
checked on 17-abr-2024
Download(s)
102
checked on 17-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.