Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph.
Maumita ChakrabortySumon ChowdhuryRajat Kumar PalPublished in: IEEE Access (2018)
Keyphrases
- spanning tree
- minimum spanning tree
- weighted graph
- graph theory
- undirected graph
- edge weights
- edge disjoint
- directed graph
- depth first search
- connected components
- minimum weight
- graph representation
- random walk
- partitioning algorithm
- learning algorithm
- graph search
- maximum weight
- web graph
- minimum cost
- graph partitioning
- graph model
- minimum spanning trees
- structured data
- maximal cliques
- maximum flow
- graph data
- data structure
- upper bound
- social networks
- graph databases
- graph properties
- total length
- strongly connected
- knn
- planar graphs
- adjacency matrix
- graph structures
- neighborhood graph
- combinatorial optimization
- traveling salesman problem
- bipartite graph
- graph structure