Packing cuts in undirected graphs.
Alberto CapraraAlessandro PanconesiRomeo RizziPublished in: Networks (2004)
Keyphrases
- undirected graph
- directed graph
- approximation algorithms
- connected components
- directed acyclic graph
- spanning tree
- packing problem
- positive integer
- minimum cost
- complex networks
- graph structure
- random graphs
- disjoint paths
- multicommodity flow
- image processing
- vertex set
- markov models
- information extraction
- data structure