• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs.

Edoardo AmaldiClaudio IulianoRomeo Rizzi
Published in: IPCO (2010)
Keyphrases
  • undirected graph
  • directed acyclic graph
  • spanning tree
  • image segmentation
  • graph structure
  • minimum cost
  • positive integer