Sciweavers

254 search results - page 15 / 51
» Deterministic Soliton Graphs
Sort
View
TVCG
2008
121views more  TVCG 2008»
14 years 9 months ago
On the Visualization of Social and other Scale-Free Networks
This paper proposes novel methods for visualizing specifically the large power-law graphs that arise in sociology and the sciences. In such cases a large portion of edges can be sh...
Yuntao Jia, Jared Hoberock, Michael Garland, John ...
108
Voted
PODC
2011
ACM
14 years 9 days ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
83
Voted
GG
2004
Springer
15 years 2 months ago
Towards Graph Programs for Graph Algorithms
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Detlef Plump, Sandra Steinert
COLT
2004
Springer
15 years 2 months ago
Learning a Hidden Graph Using O(log n) Queries Per Edge
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
Dana Angluin, Jiang Chen
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
14 years 7 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
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...
Christoph Lenzen, Roger Wattenhofer