Identification, location–domination and metric dimension on interval and permutation graphs. I. Bounds-Reference-Cited by-同舟云学术

Identification, location–domination and metric dimension on interval and permutation graphs. I. Bounds

Published:2017-03 Issue: Volume:668 Page:43-58
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Foucaud Florent,Mertzios George B.,Naserasr Reza,Parreau Aline,Valicov Petru

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference37 articles.

1. Minimal identifying codes in trees and planar graphs with large girth;Auger;European J. Combin.,2010

2. On the complexity of canonical labeling of strongly regular graphs;Babai;SIAM J. Comput.,1980

3. Network verification via routing table queries;Bampas,2011

4. L. Beaudou, P. Dankelmann, F. Foucaud, M.A. Henning, A. Mary, A. Parreau, Bounding the order of a graph using its diameter and metric dimension. A study through tree decompositions and VC dimension, Manuscript, 2016.

5. Network discovery and verification;Beerliova;IEEE J. Sel. Areas Commun.,2006

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extremal digraphs for open neighbourhood location-domination and identifying codes;Discrete Applied Mathematics;2024-04

2. Neighbourhood complexity of graphs of bounded twin-width;European Journal of Combinatorics;2024-01

3. Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications;SIAM Review;2023-11

4. On Three Domination-Based Identification Problems in Block Graphs;Algorithms and Discrete Applied Mathematics;2023

5. Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs;Discrete Applied Mathematics;2022-12