Login / Signup
Weak oddness as an approximation of oddness and resistance in cubic graphs.
Robert Lukotka
Ján Mazák
Published in:
CoRR (2016)
Keyphrases
</>
approximation algorithms
approximation error
error bounds
graph matching
graph theory
random graphs
graph clustering
max cut
closed form
structured objects
graph model
series parallel
graph theoretic
efficient computation
database
weighted graph
directed graph
pairwise