Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds.
Florent FoucaudGeorge B. MertziosReza NaserasrAline ParreauPetru ValicovPublished in: CoRR (2015)
Keyphrases
- maximum common subgraph
- upper bound
- lower bound
- connected graphs
- metric learning
- graph clustering
- metric space
- graph matching
- evaluation metrics
- graph theory
- lower and upper bounds
- location information
- graph structure
- learning algorithm
- graph embedding
- random graphs
- graph partitioning
- worst case
- error bounds
- euclidean distance
- random walk
- np complete
- sufficient conditions