Simple greedy 2-approximation algorithm for the maximum genus of a graph.

Michal Kotrbcík Martin Skoviera

Published in: CoRR (2015)

Keyphrases

random walk
connected components
graph representation
special case
social media
structured data
content analysis
bipartite graph
graph theory
directed acyclic graph