Sciweavers

1986 search results - page 48 / 398
» Path Separability of Graphs
Sort
View
VLDB
1989
ACM
97views Database» more  VLDB 1989»
14 years 23 days ago
Finding Regular Simple Paths in Graph Databases
We consider the following problem: given a labelled directedgraphG anda regularexpressionR, find all pairs of nodesconnectedby a simplepathsuchthattheconcatenationof thelabelsalon...
Alberto O. Mendelzon, Peter T. Wood
COCOON
2003
Springer
14 years 1 months ago
Fault-Hamiltonicity of Product Graph of Path and Cycle
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...
Jung-Heum Park, Hee-Chul Kim
PODC
2006
ACM
14 years 2 months ago
Computing separable functions via gossip
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...
Damon Mosk-Aoyama, Devavrat Shah
BIRTHDAY
2009
Springer
14 years 3 months ago
Path-Bicolorable Graphs
Andreas Brandstädt, Martin Charles Golumbic, ...