Login / Signup

Bounding the Number of Eulerian Tours in Undirected Graphs.

Giulia Punzi
Published in: COCOON (2022)
Keyphrases
  • undirected graph
  • computational complexity
  • upper bound
  • lower bound
  • pairwise
  • gray scale
  • traveling salesman problem