Sciweavers

684 search results - page 12 / 137
» A characterization of b-perfect graphs
Sort
View
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
15 years 5 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
NIPS
2008
15 years 1 months ago
Skill Characterization Based on Betweenness
We present a characterization of a useful class of skills based on a graphical representation of an agent's interaction with its environment. Our characterization uses betwee...
Özgür Simsek, Andrew G. Barto
SIROCCO
1998
15 years 1 months ago
Characterization results of all shortest paths interval routing schemes
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
Michele Flammini, Giorgio Gambosi, Umberto Nanni, ...
DM
2008
115views more  DM 2008»
14 years 11 months ago
Characterizations of postman sets
Using results by McKee and Woodall on binary matroids, we prove that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eu...
Néstor E. Aguilera, Valeria A. Leoni
JGT
2007
112views more  JGT 2007»
14 years 11 months ago
The 2-dimensional rigidity of certain families of graphs
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
Bill Jackson, Brigitte Servatius, Herman Servatius