1591 search results - page 171 / 319 » Random lifts of graphs |
177
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
193
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
192
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
169
click to vote
COMAD
2009
15 years 7 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
176
click to vote
SIGCOMM
2010
ACM
15 years 6 months ago
2010
ACM
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...