Sciweavers

Share
461 search results - page 1 / 93
» Convex Graph Invariants
Sort
View
CORR
2010
Springer
198views Education» more  CORR 2010»
9 years 8 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
JGAA
2008
100views more  JGAA 2008»
9 years 11 months ago
Convex Grid Drawings of Plane Graphs with Rectangular Contours
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex gr...
Kazuyuki Miura, Akira Kamada, Takao Nishizeki
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
9 years 9 months ago
A graph-theoretic approach to distributed control over networks
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...
John Swigart, Sanjay Lall
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
10 years 5 months ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...
CORR
2011
Springer
172views Education» more  CORR 2011»
9 years 6 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
books