Login / Signup
Oblivious Stacking and MAX k-CUT for Circle Graphs.
Martin Olsen
Published in:
CoRR (2021)
Keyphrases
</>
planar graphs
graph matching
graph theoretic
data sets
directed graph
vertex set
pattern recognition
hough transform
ensemble learning
graph mining
random graphs
combining multiple
connected graphs
graph databases
similarity measure
learning algorithm
data mining