1986 search results - page 48 / 398 » Path Separability of Graphs |
130
click to vote
VLDB
1989
ACM
15 years 10 months ago
1989
ACM
We consider the following problem: given a labelled directedgraphG anda regularexpressionR, find all pairs of nodesconnectedby a simplepathsuchthattheconcatenationof thelabelsalon...
154
click to vote
COCOON
2003
Springer
15 years 11 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...
164
click to vote
PODC
2006
ACM
15 years 12 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
BIRTHDAY
2009
Springer
16 years 23 days ago
2009
Springer