Sciweavers

1172 search results - page 109 / 235
» Path Algorithms on Regular Graphs
Sort
View
MSN
2007
Springer
15 years 6 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
94
Voted
JGAA
2007
87views more  JGAA 2007»
15 years 13 days ago
A 2.5D Hierarchical Drawing of Directed Graphs
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarass...
ICC
2007
IEEE
104views Communications» more  ICC 2007»
15 years 6 months ago
A Novel Graph Model for Maximum Survivability in Mesh Networks under Multiple Generic Risks
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
Qingya She, Xiaodong Huang, Jason P. Jue
122
Voted
ALGORITHMICA
2011
14 years 7 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
105
Voted
COCOON
2005
Springer
15 years 6 months ago
On the Complexity of the Balanced Vertex Ordering Problem
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
Jan Kára, Jan Kratochvíl, David R. W...