[HTML][HTML] Separating codes and traffic monitoring
T Bellitto - Theoretical Computer Science, 2018 - Elsevier
This paper studies the problem of traffic monitoring which consists of differentiating a set of
walks on a directed graph by placing sensors on as few arcs as possible. The problem of …
walks on a directed graph by placing sensors on as few arcs as possible. The problem of …
The anonymous subgraph problem
In this work we address the Anonymous Subgraph Problem (ASP). The problem asks to
decide whether a directed graph contains anonymous subgraphs of a given family. This …
decide whether a directed graph contains anonymous subgraphs of a given family. This …
Separating Codes and Traffic Monitoring
T Bellitto - Algorithmic Aspects in Information and Management …, 2016 - Springer
This paper studies the problem of traffic monitoring which consists in differentiating a set of
walks on a directed graphs by placing sensors on as few arcs as possible. The problem of …
walks on a directed graphs by placing sensors on as few arcs as possible. The problem of …
The Anonymous subgraph problem.
A Bettinelli, L Liberti, F Raimondi… - … Workshop 2009: 8th …, 2009 - repository.mdx.ac.uk
Many problems can be modeled as the search for a subgraph SA with specifi c properties,
given a graph G=(V; A). There are applications in which it is desirable to ensure also S to be …
given a graph G=(V; A). There are applications in which it is desirable to ensure also S to be …