Login / Signup
Universality and asymptotics of graph counting problems in non-orientable surfaces.
Stavros Garoufalidis
Marcos Mariño
Published in:
J. Comb. Theory, Ser. A (2010)
Keyphrases
</>
three dimensional
optimization problems
markov chain
np complete
directed graph
range data
evolutionary algorithm
surface reconstruction
graph theory
problems involving
graph partitioning
graph representation
free form