A new notion of vertex independence and rank for finite graphs.
John L. RhodesPedro V. SilvaPublished in: Int. J. Algebra Comput. (2015)
Keyphrases
- undirected graph
- labeled graphs
- directed graph
- attributed graphs
- hamiltonian cycle
- maximum cardinality
- connected subgraphs
- average degree
- rank order
- graph clustering
- bipartite graph
- connected graphs
- graph matching
- structural learning
- vertex set
- belief merging
- subgraph isomorphism
- graph data
- graph kernels
- knowledge base
- edge weights
- graph partitioning
- graph databases
- graph mining
- finite number
- graph structure
- ranked list
- approximation algorithms
- complex networks