Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph.
Alexandr ValyuzhenichPublished in: Discret. Math. (2021)
Keyphrases
- graph laplacian
- spanning tree
- graph theory
- graph structure
- graph theoretic
- weighted graph
- graph representation
- distance measure
- random walk
- directed graph
- graph matching
- constant factor
- graph model
- edge disjoint
- image segmentation
- minimum spanning tree
- minimum cost
- link analysis
- connected components
- structured data
- graphical models