Separating codes and traffic monitoring

DOI10.1007/978-3-319-41168-2_8MaRDI QIDQ2830061zbMATH OpenOpenAlexFDO

Authors Thomas Bellitto

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Traffic problems in operations research (90B20)

Recommendations

• Separating codes and traffic monitoring
• Distributed monitoring problem
• Locating active sensors on traffic networks
• Locating sensors to observe network arc flows: exact and heuristic approaches
• Models and algorithms for the screen line-based traffic-counting location problems

Cites work

• A Branch and Bound Algorithm for Feature Subset Selection
• Approximation algorithms for the test cover problem
• Comments on "Derivation of Minimal Complete Sets of Test-Input Sequences Using Boolean Differences"
• Discriminating codes in (bipartite) planar graphs
• Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
• How complex are random graphs in first order logic?
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• On a new class of codes for identifying vertices in graphs
• On strongly identifying codes
• Open neighborhood locating-dominating in trees

Cited in

(1)

• Separating codes and traffic monitoring

This page was built for publication: Separating codes and traffic monitoring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830061)