356 search results - page 63 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
123
Voted
STOC
2009
ACM
16 years 28 days ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
115
click to vote
CCS
2009
ACM
16 years 28 days ago
2009
ACM
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
98
Voted
STOC
2010
ACM
15 years 5 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
113
click to vote
AFRIGRAPH
2007
ACM
15 years 4 months ago
2007
ACM
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...
95
Voted
DM
1998
14 years 12 months ago
1998
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...