1542 search results - page 191 / 309 » The metamathematics of random graphs |
131
Voted
APPROX
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
131
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
112
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
122
click to vote
SIGCOMM
2006
ACM
15 years 7 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
93
Voted
WEA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...