Sciweavers

990 search results - page 56 / 198
» Sub-Graphs of Complete Graph
Sort
View
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
IACR
2011
166views more  IACR 2011»
12 years 8 months ago
Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 family
We introduce a new concept in splice-and-cut attacks on hash functions, which bridges the gap between preimage attacks and a powerful method of differential cryptanalysis. The ne...
Dmitry Khovratovich, Christian Rechberger, Alexand...
STACS
2010
Springer
14 years 4 months ago
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
Bireswar Das, Jacobo Torán, Fabian Wagner
GD
2005
Springer
14 years 2 months ago
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
WG
2001
Springer
14 years 1 months ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...