796 search results - page 54 / 160 » The Anonymous Subgraph Problem |
125
Voted
CCS
2009
ACM
15 years 7 months ago
2009
ACM
Network information distribution is a fundamental service for any anonymization network. Even though anonymization and information distribution about the network are two orthogona...
80
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
103
Voted
DASFAA
2009
IEEE
15 years 4 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
DAM
2010
15 years 23 days ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
109
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...