On completely regular codes with minimum eigenvalue in geometric graphs.
Ivan Yu. MogilnykhKonstantin V. Vorob'evPublished in: CoRR (2022)
Keyphrases
- spanning tree
- graph theoretical
- least squares
- error correction
- graph matching
- connected dominating set
- covariance matrix
- graph databases
- graph partitioning
- graph theory
- directed graph
- minimum cost
- reeb graph
- graph theoretic
- image segmentation
- labeled graphs
- data sets
- perturbation theory
- dominating set
- logical operations
- topological information
- error correcting codes
- maximal cliques
- object recognition
- geometric constraints