Sciweavers

1756 search results - page 24 / 352
» Directed scale-free graphs
Sort
View
CATS
2006
13 years 9 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
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...
A. V. Kelarev
WDAG
2000
Springer
112views Algorithms» more  WDAG 2000»
13 years 11 months ago
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs
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...
Paolo Boldi, Sebastiano Vigna
DAM
2011
13 years 2 months ago
Weak sense of direction labelings and graph embeddings
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...
Christine T. Cheng, Ichiro Suzuki
CIDM
2009
IEEE
13 years 11 months ago
Faster computation of the direct product kernel for graph classification
The direct product kernel, introduced by G
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
PAMI
2010
103views more  PAMI 2010»
13 years 6 months ago
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
—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...
Amin Mantrach, Luh Yen, Jérôme Callut...