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

DOI10.1007/978-3-642-35926-2_4zbMath1293.05365OpenAlexW157345956MaRDI QIDQ2876554

Florent Foucaud, Matjaž Kovše

Publication date: 19 August 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35926-2_4

zbMATH Keywords

identificationpathsapproximationtest cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Identifying path covers in graphs ⋮ Improved kernels for tracking paths

This page was built for publication: On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths