Sign in
On approximating maximum covering cycles in undirected graphs.
Dirk Briskorn
Published in:
Optim. Lett. (2019)
Keyphrases
</>
undirected graph
approximation algorithms
directed graph
directed acyclic graph
minimum cost
spanning tree
complex networks
connected components
disjoint paths
multicommodity flow
positive integer
markov models
graph structure
strongly connected
vertex set
random variables
special case
pairwise