Login / Signup

On the Number of Cycles in Planar Graphs.

Kevin BuchinChristian KnauerKlaus KriegelAndré SchulzRaimund Seidel
Published in: COCOON (2007)
Keyphrases
  • undirected graph
  • planar graphs
  • approximation algorithms
  • minimum cost
  • edge detection
  • shortest path