Sciweavers

650 search results - page 68 / 130
» Positive graphs
Sort
View
GC
2007
Springer
13 years 10 months ago
Rainbows in the Hypercube
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz,...
CDC
2009
IEEE
135views Control Systems» more  CDC 2009»
13 years 7 months ago
Formation control via distributed optimization of alignment error
This paper proposes a method for the stabilization of vehicle formations in the plane under a fixed, but not necessarily complete, sensing graph. In this method each agent acts to ...
Brandon J. Moore, Carlos Canudas de Wit
ICMCS
2007
IEEE
125views Multimedia» more  ICMCS 2007»
14 years 4 months ago
A Framework for Provisioning Overlay Network Based Multimedia Distribution Services
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
Dewan Tanvir Ahmed, Shervin Shirmohammadi
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
13 years 10 months ago
Which Chessboards have a Closed Knight's Tour within the Cube?
A closed knight’s tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its starting position. When the chessboard is translated i...
Joe DeMaio
COCOON
2001
Springer
14 years 2 months ago
Finding the Most Vital Node of a Shortest Path
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
Enrico Nardelli, Guido Proietti, Peter Widmayer