441 search results - page 1 / 89 » Convex Graph Invariants |
CORR
2010
Springer
13 years 1 months ago
2010
Springer
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 ...
CDC
2009
IEEE
13 years 2 months ago
2009
IEEE
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...
JGAA
2008
13 years 4 months ago
2008
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...
SAS
2005
Springer
13 years 9 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
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...