Login / Signup

Efficient deterministic algorithms for finding optimal cycle bases in undirected graphs.

Claudio Iuliano
Published in: 4OR (2013)
Keyphrases
  • finding optimal
  • undirected graph
  • approximation algorithms
  • directed graph
  • complex networks