Login / Signup
A Helly theorem for geodesic convexity in strongly dismantlable graphs.
Norbert Polat
Published in:
Discret. Math. (1995)
Keyphrases
</>
bayesian networks
graph theoretic
graph matching
graph theory
graph mining
directed graph
structured objects
clustering algorithm
graph partitioning
pattern recognition
convex hull
bipartite graph
distance transform
weighted graph
graph representation