An algorithm for generating generalized splines on graphs such as complete graphs, complete bipartite graphs and hypercubes.
Radha Madhavi DuggarajuLipika MazumdarPublished in: AKCE Int. J. Graphs Comb. (2020)
Keyphrases
- bipartite graph
- maximum cardinality
- graph clustering
- maximum matching
- dynamic programming
- learning algorithm
- graph isomorphism
- random graphs
- search space
- minimum weight
- edge weights
- graph structure
- optimal solution
- graph partitioning
- graph model
- clustering method
- undirected graph
- minimum spanning tree
- matching algorithm
- bipartite networks
- np hard
- data sets
- information retrieval
- graph mining
- graph matching
- spectral clustering
- directed graph
- b spline
- lower bound