2322 search results - page 43 / 465 » On a game in directed graphs |
CATS
2006
15 years 1 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
WDAG
2000
Springer
15 years 3 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
121
click to vote
DAM
2011
14 years 6 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
CIDM
2009
IEEE
15 years 3 months ago
2009
IEEE
The direct product kernel, introduced by G
PAMI
2010
14 years 10 months ago
2010
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...