An Efficient Algorithm to Find all 'Bidirectional' Edges of an Undirected Graph

Bhubaneswar Mishra

Published in: FOCS (1984)

Keyphrases

undirected graph
spanning tree
computational complexity
segmentation algorithm
learning algorithm
computationally efficient
dynamic programming
k means
probabilistic model
np hard
directed graph
preprocessing
objective function
similarity measure
search space
detection algorithm
data streams