Approximate cycles count in undirected graphs.
Maytham SafarKhaled MahdiHisham FarahatSaud AlbehairyAli KassemKhalid AlenziPublished in: Int. J. Comput. Intell. Syst. (2014)
Keyphrases
- undirected graph
- directed graph
- approximation algorithms
- graph structure
- minimum cost
- complex networks
- directed acyclic graph
- spanning tree
- markov models
- random graphs
- vertex set
- multicommodity flow
- optimal solution
- average degree
- positive integer
- higher order
- strongly connected
- connected components
- input image
- disjoint paths
- np hard