32545 search results - page 618 / 6509 » Data Structures and Algorithms |
184
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
212
click to vote
SWAT
2000
Springer
15 years 11 months ago
2000
Springer
We consider dictionaries over the universe U = {0, 1}w on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with m...
199
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
168
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
We study the generation of uniformly distributed linear extensions using Markov chains. In particular we show that monotone coupling from the past can be applied in the case of lin...
248
click to vote
JMLR
2012
13 years 10 months ago
2012
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...