Separating Codes and Traffic Monitoring
From MaRDI portal
Publication:2830061
DOI10.1007/978-3-319-41168-2_8zbMath1481.90112OpenAlexW2484364851MaRDI QIDQ2830061
Publication date: 9 November 2016
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-41168-2_8
Cites Work
- Unnamed Item
- Unnamed Item
- Open neighborhood locating-dominating in trees
- Discriminating codes in (bipartite) planar graphs
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
- 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
- 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