Sciweavers

796 search results - page 151 / 160
» The Anonymous Subgraph Problem
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 7 months ago
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
15 years 6 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira
TCBB
2008
117views more  TCBB 2008»
15 years 5 months ago
Consensus Genetic Maps as Median Orders from Inconsistent Sources
A genetic map is an ordering of genetic markers calculated from a population of known lineage. Although, traditionally, a map has been generated from a single population for each s...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
ASIACRYPT
2010
Springer
15 years 3 months ago
Structured Encryption and Controlled Disclosure
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
Melissa Chase, Seny Kamara
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 8 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...