Login / Signup
Complexity of Finding Perfect Bipartite Matchings Minimizing the Number of Intersecting Edges.
Grzegorz Guspiel
Published in:
CoRR (2017)
Keyphrases
</>
small number
computational complexity
memory requirements
undirected graph
neural network
finite number
space complexity
maximum number
multiscale
lower bound
approximation error