A new notion of vertex independence and rank for finite graphs.
John RhodesPedro V. SilvaPublished in: CoRR (2012)
Keyphrases
- undirected graph
- directed graph
- attributed graphs
- labeled graphs
- hamiltonian cycle
- maximum cardinality
- learning from positive data
- connected subgraphs
- belief merging
- graph matching
- graph representation
- graph theoretic
- minimum weight
- random graphs
- average degree
- graph clustering
- graph model
- graph theory
- bipartite graph
- graph kernels
- rank aggregation
- social networks
- vertex set
- edge weights
- complex structures
- betweenness centrality
- spanning tree
- random walk