Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

COLOGNETWENTE
2009

favoriteEmaildiscussreport

125views Optimization» more COLOGNETWENTE 2009»

The Anonymous Subgraph Problem

13 years 5 months ago

The Anonymous Subgraph Problem

Download www.eis.mdx.ac.uk

Andrea Bettinelli, Leo Liberti, Franco Raimondi, D

Real-time Traffic

COLOGNETWENTE 2007 | COLOGNETWENTE 2009 |

claim paper

Related Content

» Kisomorphism privacy preserving network publication against structural attacks

» MARGIN Maximal Frequent Subgraph Mining

» On the Advantage over Random for Maximum Acyclic Subgraph

» Centerpiece subgraphs problem definition and fast solutions

» CP Models for Maximum Common Subgraph Problems

» Spectral Densest Subgraph and Independence Number of a Graph

» FLAIM A Multilevel Anonymization Framework for Computer and Network Logs

» Subgraph Isomorphism in Planar Graphs and Related Problems

» Isomorphic Subgraphs

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2009
Where	COLOGNETWENTE
Authors	Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey

Comments (0)