Sciweavers

441 search results - page 60 / 89
» Convex Graph Invariants
Sort
View
CDC
2010
IEEE
186views Control Systems» more  CDC 2010»
13 years 2 months ago
Approximation and limiting behavior of random models
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
Behrouz Touri, Angelia Nedic
JCT
2011
93views more  JCT 2011»
12 years 10 months ago
A graph-theoretic approach to quasigroup cycle numbers
Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the tria...
Brent Kerby, Jonathan D. H. Smith
WG
1998
Springer
13 years 11 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
CVPR
2008
IEEE
14 years 9 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
COCOON
2007
Springer
14 years 1 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...