Identifying path covers in graphs
type: Item
instance of: scholarly article
title: Identifying path covers in graphs
zbMATH Open document ID: 1334.05117
author: Florent Foucaud
author: Matjaž Kovše
published in: Journal of Discrete Algorithms
publication date: 2014-08-13T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6329919
zbMATH Keywords: test cover
zbMATH Keywords: identification
zbMATH Keywords: paths
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: j.jda.2013.07.006
OpenAlex ID: W2070240448
cites work: Watching systems in graphs: an extension of identifying codes
cites work: Induced subsets
cites work: Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
cites work: Structural properties of twin-free graphs
cites work: Identifying and locating-dominating codes: NP-completeness results for directed graphs
cites work: Complexity of approximating bounded variants of optimization problems
cites work: Approximation algorithms for the test cover problem
cites work: Extremal graphs for the identifying code problem
cites work: Identifying Codes in Line Graphs
cites work: On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths
cites work: Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
cites work: Codes identifying sets of vertices in random networks
cites work: Q4198056
cites work: Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
cites work: Approximation algorithms for combinatorial problems
cites work: On a new class of codes for identifying vertices in graphs
cites work: An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
cites work: Q4298260
cites work: On the identification of vertices using cycles
DOI: 10.1016/J.JDA.2013.07.006
description: scientific article; zbMATH DE number 6329919