Sorry, we do not have enough data to show an influence graph for this author.
Learn More
The all-bidirectional-edges problem is to find an edge-labeling of an undirected networkG=(V, E), with a source and a sink, such that an edgee=uv inE is labeled 〈u, v〉 or 〈u, u〉 (or both) depending on the existence of a (simple) path from the source to the sink traversinge, that visits the verticesu andv in the orderu, v orv, u respectively. The best-known(More)
  • 1