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.

[img]
Preview
PDF
Download (127kB)

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.

Item Type: Conference or Workshop Item (Paper)
Research Areas: A. > School of Science and Technology > Computer Science
A. > School of Science and Technology > Computer Science > Foundations of Computing group
A. > School of Science and Technology > Computer Science > SensoLab group
A. > School of Science and Technology > Computer Science > Artificial Intelligence group
A. > School of Science and Technology > Computer Science > Intelligent Environments Research Group
Item ID: 5274
Useful Links:
Depositing User: Franco Raimondi
Date Deposited: 29 Apr 2010 14:49
Last Modified: 06 Dec 2016 17:17
URI: http://eprints.mdx.ac.uk/id/eprint/5274

Available Versions of this Item

  • The Anonymous subgraph problem. (deposited 29 Apr 2010 14:49) [Currently Displayed]

Actions (login required)

Edit Item Edit Item

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