1729 search results - page 289 / 346 » On Bounds for the k-Partitioning of Graphs |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
PET
2009
Springer
15 years 4 months ago
2009
Springer
There exist well established models for anonymity focusing on traffic analysis, i. e., analysing properties of single messages as, e. g., timing. However there is only little work ...
WCNC
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, a cooperative transmission design for a multi-node wireless cluster network is presented. It is assumed that the nodes operate in half-duplex mode and that channe...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— The paper focuses on leader-follower formations of nonholonomic mobile robots. A formation control alternative to those existing in the literature is introduced. We show that t...
CP
2007
Springer
15 years 4 months ago
2007
Springer
We propose a new top down search-based algorithm for compiling AND/OR Multi-Valued Decision Diagrams (AOMDDs), as representations of the optimal set of solutions for constraint opt...