Sciweavers

5100 search results - page 141 / 1020
» The Linear Complexity of a Graph
Sort
View
AGP
1999
IEEE
14 years 1 months ago
Freeness Analysis through Linear Refinement
Domains Decomposing Non-Redundant Sharing by Complementation . . . . . . . . . . . . . 69 Enea Zaffanella, Patricia M. Hill, Roberto Bagnara Freeness Analysis Through Linear Refine...
Patricia M. Hill, Fausto Spoto
CDC
2008
IEEE
147views Control Systems» more  CDC 2008»
13 years 11 months ago
Synchronization in networks of identical linear systems
The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main resul...
Luca Scardovi, Rodolphe Sepulchre
CAGD
2006
73views more  CAGD 2006»
13 years 9 months ago
Rational surfaces with linear normals and their convolutions with rational surfaces
It is shown that polynomial (or rational) parametric surfaces with a linear field of normal vectors are dual to graphs bivariate polynomials (or rational functions). We discuss th...
Maria Lucia Sampoli, Martin Peternell, Bert Jü...
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
13 years 9 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
14 years 1 months ago
Grid Graph Reachability Problems
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
Eric Allender, David A. Mix Barrington, Tanmoy Cha...