1830 search results - page 269 / 366 » Workshop on Graph Computation Models |
146
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
152
click to vote
BIBE
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
137
click to vote
HM
2007
Springer
15 years 11 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
188
click to vote
CLA
2007
15 years 6 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
157
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...