Resolving sets in temporal graphs
From MaRDI portal
Cites work
- A game of cops and robbers on graphs with periodic edge-connectivity
- An introduction to temporal graphs: an algorithmic perspective
- Complexity of metric dimension on planar graphs
- Connectivity and inference problems for temporal networks
- Cops \& robber on periodic temporal graphs: characterization and improved bounds
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 7560302 (Why is no real title available?)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Landmarks in graphs
- Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
- Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
- On the exploration of time-varying networks
- Reducibility among combinatorial problems
- Resolvability in graphs and the metric dimension of a graph
- Resolving sets in temporal graphs
- Searching for black holes in subways
- Sharp bound on the truncated metric dimension of trees
- Temporal network theory
- The (weighted) metric dimension of graphs: hard and easy cases
- The complexity of finding small separators in temporal graphs
- The metric dimension of the lexicographic product of graphs
- Truncated metric dimension for finite graphs
Cited in
(2)
This page was built for publication: Resolving sets in temporal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021089)
