Dataset - CKAN

Combinatorial and algorithmic aspects of identifying codes in graphs

We study combinatorial and algorithmic aspects of identifying codes in graphs. An identifying code is a set of vertices of a graph such that, on the one hand, each...
- HTML
Tolerant identification with Euclidean balls

International audience
- HTML
Locally identifying coloring of graphs

21 pages
- HTML
Decision and approximation complexity for identifying codes and locating-domi...

International audience
- HTML

You can also access this registry using the API (see API Docs).