The Anonymous subgraph problem.
Bettinelli, Andrea and Liberti, Leo and Raimondi, Franco and Savourey, David (2009) The Anonymous subgraph problem. In: Cologne Twente Workshop 2009: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, June 2-4, 2009, Paris.
This is the latest version of this item.
Official URL: http://www.lix.polytechnique.fr/ctw09/ctw09-procee...
Many problems can be modeled as the search for a subgraph S- A with specifi�c properties, given a graph G = (V;A). There are applications in which it is desirable to ensure also S to be anonymous. In this work we formalize an anonymity property for a generic family of subgraphs and the corresponding decision problem. We devise an algorithm to solve a particular case of the problem and we show that, under certain conditions, its computational complexity is polynomial. We also examine in details several specifi�c family of subgraphs.
|Item Type:||Conference or Workshop Item (Paper)|
|Research Areas:||School of Science and Technology > Science & Technology|
|Deposited On:||29 Apr 2010 14:49|
|Last Modified:||25 Jul 2014 06:09|
Available Versions of this Item
- The Anonymous subgraph problem. (deposited 29 Apr 2010 14:49) [Currently Displayed]
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year