Login / Signup

Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph.

Michal KotrbcíkMartin Skoviera
Published in: SOSA (2019)
Keyphrases
  • random walk
  • graph theory
  • dynamic programming
  • connected components
  • graph model
  • graph databases
  • graph representation