An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
Naveed Ahmed AzamAleksandar ShurbevskiHiroshi NagamochiPublished in: Entropy (2020)
Keyphrases
- undirected graph
- computational complexity
- learning algorithm
- tree structure
- spanning tree
- graph structure
- random graphs
- space complexity
- dynamic programming
- detection algorithm
- polynomial time complexity
- memory requirements
- k means
- minimum spanning tree
- worst case
- knn
- attributed graphs
- directed graph
- optimal solution
- hamiltonian cycle
- classification trees
- matching algorithm
- weighted graph
- computationally efficient
- expectation maximization
- np hard
- objective function
- similarity measure