2294 search results - page 175 / 459 » From Path Graphs to Directed Path Graphs |
116
click to vote
INFOCOM
2012
IEEE
13 years 16 days ago
2012
IEEE
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
AAAI
2008
15 years 12 days ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
UIDIS
2001
14 years 11 months ago
2001
This paper focuses on the use of elaborated computer visualization techniques to support multi-user browsing within a digital collection of library books and subject categories. F...
DIS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
105
click to vote
DAM
2011
14 years 5 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...