A bound for the distinguishing index of regular graphs.
Florian LehnerMonika PilsniakMarcin StawiskiPublished in: Eur. J. Comb. (2020)
Keyphrases
- lower bound
- upper bound
- directed graph
- graph matching
- graph theoretic
- index structure
- graph theory
- error bounds
- graph partitioning
- spanning tree
- structural similarity
- indexing method
- graph structures
- series parallel
- graph representation
- database
- query graph
- undirected graph
- graph model
- b tree
- random walk
- multi dimensional
- image segmentation
- social networks
- data sets