C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs.
Bojan Mohar
Yifan Jing
Published in:
FOCS (2018)
Keyphrases
</>
polynomial time approximation
approximation algorithms
np hard
error bounds
bin packing
search space
dynamic programming
multi dimensional
linear programming
theoretical analysis
graph matching
graph databases