4047 search results - page 261 / 810 » Some Properties and Some Problems on Set Functors |
176
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...
186
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
163
click to vote
ECCC
2002
15 years 6 months ago
2002
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...
171
click to vote
IC
2003
15 years 7 months ago
2003
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...
167
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...