Sciweavers

3396 search results - page 129 / 680
» Tree representations of graphs
Sort
View
EUROPAR
2009
Springer
14 years 3 months ago
Steady-State for Batches of Identical Task Trees
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
Sékou Diakité, Loris Marchal, Jean-M...
MFCS
2005
Springer
14 years 2 months ago
D-Width: A More Natural Measure for Directed Tree Width
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
Mohammad Ali Safari
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 2 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
TCS
2008
13 years 9 months ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 9 months ago
Asteroids in rooted and directed path graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
Kathie Cameron, Chính T. Hoàng, Benj...