2294 search results - page 22 / 459 » From Path Graphs to Directed Path Graphs |
104
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
TCS
2008
14 years 9 months ago
2008
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
COLING
2008
14 years 11 months ago
2008
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
IPL
2006
14 years 9 months ago
2006
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
ICCD
2004
IEEE
15 years 6 months ago
2004
IEEE
ACG (Adjacent Constraint Graph) is invented as a general floorplan representation. It has advantages of both adjacency graph and constraint graph of a floorplan: edges in an ACG...