The anonymous subgraph problem
Article
Bettinelli, A., Liberti, L., Raimondi, F. and Savourey, D. 2013. The anonymous subgraph problem. Computers and Operations Research. 40 (4), pp. 973-979. https://doi.org/10.1016/j.cor.2012.11.018
Type | Article |
---|---|
Title | The anonymous subgraph problem |
Authors | Bettinelli, A., Liberti, L., Raimondi, F. and Savourey, D. |
Abstract | In this work we address the Anonymous Subgraph Problem (ASP). The problem asks to decide whether a directed graph contains anonymous subgraphs of a given family. This problem has a number of practical applications and here we describe three of them (Secret Santa Problem, anonymous routing, robust paths) that can be formulated as ASPs. Our main contributions are (i) a formalization of the anonymity property for a generic family of subgraphs, (ii) an algorithm to solve the ASP in time polynomial in the size of the graph under a set of conditions, and (iii) a thorough evaluation of our algorithms using various tests based both on randomly generated graphs and on real-world instances. |
Publisher | Elsevier |
Journal | Computers and Operations Research |
ISSN | 0305-0548 |
Publication dates | |
01 Apr 2013 | |
Online | 05 Dec 2012 |
Publication process dates | |
Deposited | 23 Apr 2015 |
Output status | Published |
Copyright Statement | This is a RoMEO green journal - |
Additional information | Published online: 5 December 2012 |
Digital Object Identifier (DOI) | https://doi.org/10.1016/j.cor.2012.11.018 |
Language | English |
First submitted version |
https://repository.mdx.ac.uk/item/850y6
Download files
49
total views8
total downloads0
views this month0
downloads this month