On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths

Foucaud, Florent; Kovše, Matjaž

doi:10.1007/978-3-642-35926-2_4

Search citation statements

Order By: Relevance

Paper Sections

Select...

Test Covers and The Identification Problem1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Given a set system of individuals and attributes, the MIN-TC problem asks for a minimum subset C of A such that for each pair I, I ′ of I, there is an element C of C such that exactly one of I, I ′ is covered by C, that is, belongs to C (we say that C separates I from I ′ ). The MIN-TC problem appears in a large number of papers under different denominations (minimum test cover ✩ A shorter version of this paper appeared under the name On graph identification problems and the special case of identifying vertices using paths in the Proceedings of the International Workshop on Combinatorial Algorithms, IWOCA 2012 [11]. The present paper contains additional results, mainly Theorems 8, 10 and 20, and a corrected version of Theorems 17 and 18, which contained some mistakes in the short version.…”

Section: Test Covers and The Identification Problemmentioning

confidence: 99%