76 search results - page 3 / 16 » Judicious partitions of directed graphs |
GD
2004
Springer
14 years 3 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
JGAA
2007
13 years 9 months ago
2007
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 ...
ALGOSENSORS
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Motivated by the need for agent classification in sensor networking and autonomous vehicle control applications, we propose a flexible and distributed stochastic automato...
PC
2000
13 years 9 months ago
2000
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
EJC
2008
13 years 9 months ago
2008
Abstract. We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (`reflection posit...