863 search results - page 16 / 173 » Links in edge-colored graphs |
EJC
2010
13 years 8 months ago
2010
A graph is k-linked (k-edge-linked), k 1, if for each k pairs of vertices x1, y1,
JCT
2008
13 years 8 months ago
2008
A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2, . . . , xk, y1, y2, . . . , yk of distinct vertices, G contains k vertex-disjoint paths P1, P2,...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
WDAG
2007
Springer
14 years 2 months ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
ICSE
2003
IEEE-ACM
14 years 8 months ago
2003
IEEE-ACM