On Graphs and Codes Preserved by Edge Local Complementation
Lars Eirik DanielsenMatthew Geoffrey ParkerConstanza RieraJoakim Grahl KnudsenPublished in: CoRR (2010)
Keyphrases
- weighted graph
- undirected graph
- graph matching
- graph theory
- error correction
- edge weights
- graph theoretic
- minimum spanning trees
- graph structure
- neural network
- adjacency graph
- graph clustering
- graph mining
- graph model
- edge information
- directed graph
- edge detection
- strongly connected
- multiscale
- data sets
- similarity measure
- vertex set
- error control
- error correcting codes
- graph construction
- random graphs
- bipartite graph
- graph data
- random walk
- spanning tree
- data objects