The Anonymous subgraph problem.

Bettinelli, Andrea, Liberti, Leo, Raimondi, Franco ORCID: https://orcid.org/0000-0002-9508-7713 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. . [Conference or Workshop Item]

Preview

PDF Download (127kB) | Preview

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 group
Item ID:	5274
Useful Links:	http://www.lix.polytechnique.fr/ctw09/ Middlesex University Expert Profile
Depositing User:	Franco Raimondi
Date Deposited:	29 Apr 2010 14:49
Last Modified:	30 Nov 2022 01:30
URI:	https://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)

View Item