Separating codes and traffic monitoring
From MaRDI portal
Publication:1704860
DOI10.1016/j.tcs.2017.03.044zbMath1388.68209OpenAlexW2606478473MaRDI QIDQ1704860
Publication date: 13 March 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.03.044
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
On the density of sets of the Euclidean plane avoiding distance 1 ⋮ Density estimates of 1-avoiding sets via higher order correlations ⋮ Polynomial time algorithms for tracking path problems ⋮ Proper‐walk connection number of graphs ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Open neighborhood locating-dominating in trees
- Discriminating codes in (bipartite) planar graphs
- Two-factors in orientated graphs with forbidden transitions
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
- Compatible path-cycle-decompositions of plane graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Approximation algorithms for the test cover problem
- On strongly identifying codes
- Finding paths in graphs avoiding forbidden transitions
- Finding Paths in Grids with Forbidden Transitions
- Properly Coloured Cycles and Paths: Results and Open Problems
- Comments on "Derivation of Minimal Complete Sets of Test-Input Sequences Using Boolean Differences"
- A Branch and Bound Algorithm for Feature Subset Selection
- On a new class of codes for identifying vertices in graphs
- How complex are random graphs in first order logic?
This page was built for publication: Separating codes and traffic monitoring
