) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph.
Massimo CairoPaul MedvedevNidia Obscura AcostaRomeo RizziAlexandru I. TomescuPublished in: ACM Trans. Algorithms (2019)
Keyphrases
- detection algorithm
- dynamic programming
- shortest path problem
- cost function
- graph structure
- k means
- np hard
- weighted graph
- probabilistic model
- computational cost
- preprocessing
- computational complexity
- learning algorithm
- objective function
- search space
- graph partitioning
- optimal solution
- depth first search
- undirected graph
- spanning tree
- dominating set
- graph mining
- connected components
- matching algorithm
- optimization algorithm
- expectation maximization
- simulated annealing
- data structure