The Anonymous subgraph problem.
Conference paper
Bettinelli, A., Liberti, L., Raimondi, F. and Savourey, D. 2009. The Anonymous subgraph problem. Cologne Twente Workshop 2009: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Paris 02 - 04 Jun 2009 pp. 269-274
Type | Conference paper |
---|---|
Title | The Anonymous subgraph problem. |
Authors | Bettinelli, A., Liberti, L., Raimondi, F. and Savourey, D. |
Abstract | 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. |
Research Group | Foundations of Computing group |
SensoLab group | |
Artificial Intelligence group | |
Research Group on Development of Intelligent Environments | |
Conference | Cologne Twente Workshop 2009: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization |
Page range | 269-274 |
Publication process dates | |
Deposited | 29 Apr 2010 |
Output status | Published |
Web address (URL) | http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf |
Language | English |
File |
Permalink -
https://repository.mdx.ac.uk/item/829v3
Download files
34
total views5
total downloads1
views this month0
downloads this month