Separating codes and traffic monitoring

DOI10.1016/J.TCS.2017.03.044MaRDI QIDQ1704860zbMATH OpenOpenAlexFDO

Authors Thomas Bellitto

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

zbMATH Keywords

forbidden-transition graphsseparating codesseparation on languagestraffic monitoring

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

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"
• Compatible path-cycle-decompositions of plane graphs
• Discriminating codes in (bipartite) planar graphs
• Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
• Finding paths in graphs avoiding forbidden transitions
• Finding paths in grids with forbidden transitions
• 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
• Properly coloured cycles and paths: Results and open problems
• Two-factors in orientated graphs with forbidden transitions

Cited in

(8)

• Density estimates of 1-avoiding sets via higher order correlations
• Polynomial time algorithms for tracking path problems
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
• Separating codes and traffic monitoring
• On the density of sets of the Euclidean plane avoiding distance 1
• Proper‐walk connection number of graphs
• scientific article; zbMATH DE number 7765417 (Why is no real title available?)
• An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints

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 Q1704860)