684 search results - page 12 / 137 » A characterization of b-perfect graphs |
119
click to vote
ISCAS
2003
IEEE
15 years 7 months ago
2003
IEEE
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...
NIPS
2008
15 years 3 months ago
2008
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...
117
click to vote
SIROCCO
1998
15 years 3 months ago
1998
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...
105
click to vote
DM
2008
15 years 1 months ago
2008
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...
JGT
2007
15 years 1 months ago
2007
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...