1729 search results - page 76 / 346 » Bound Graph Polysemy |
192
Voted
WG
2010
Springer
15 years 3 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
185
click to vote
SDM
2012
SIAM
13 years 7 months ago
2012
SIAM
In this article, we propose a random walk-based model to predict legislators’ votes on a set of bills. In particular, we first convert roll call data, i.e. the recorded votes a...
126
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
145
click to vote
COLT
2007
Springer
15 years 11 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
163
Voted
NETWORKS
2006
15 years 4 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...