1447 search results - page 44 / 290 » Graphs and Path Equilibria |
128
Voted
TCS
2008
15 years 3 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...
145
click to vote
ISCI
2008
15 years 3 months ago
2008
This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n1 between any pair of vertices in an (n, k)-star graph wi...
102
click to vote
VLDB
1989
ACM
15 years 7 months ago
1989
ACM
We consider the following problem: given a labelled directedgraphG anda regularexpressionR, find all pairs of nodesconnectedby a simplepathsuchthattheconcatenationof thelabelsalon...
129
Voted
COCOON
2003
Springer
15 years 8 months ago
2003
Springer
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
154
click to vote
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...