Searching for a cycle with maximum coverage in undirected graphs.

Andrea Grosso Fabio Salassa Wim Vancroonenburg

Published in: Optim. Lett. (2016)

Keyphrases

undirected graph
directed acyclic graph
approximation algorithms
directed graph
disjoint paths
markov models
minimum cost
spanning tree
connected components
complex networks
graph structure
random graphs
strongly connected
vertex set
social network analysis
higher order
data streams
data mining