Sciweavers

36 search results - page 2 / 8
» A new family of locally 5-arc transitive graphs
Sort
View
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
13 years 10 months ago
Modal and transition dwell time computation in switching systems: a set-theoretic approach
We consider a plant the dynamics of which switch among a family of systems. Each of these systems has a single stable equilibrium point. We assume that a constraint region for the...
Franco Blanchini, Daniele Casagrande, Stefano Mian...
IACR
2011
104views more  IACR 2011»
12 years 4 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia
DCG
2011
13 years 7 days ago
New Classes of Counterexamples to Hendrickson's Global Rigidity Conjecture
We examine the generic local and global rigidity of various graphs in Rd . Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d + 1)-connected...
Samuel Frank, Jiayang Jiang
FOCS
2009
IEEE
14 years 2 hour ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 6 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...