Identifying path covers in graphs
From MaRDI portal
Publication:396675
DOI10.1016/j.jda.2013.07.006zbMath1334.05117OpenAlexW2070240448MaRDI QIDQ396675
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.07.006
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (5)
On the path separation number of graphs ⋮ Improved kernels for tracking paths ⋮ On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results ⋮ Separating path systems for the complete graph ⋮ Locating-Domination and Identification
Cites Work
- Unnamed Item
- Unnamed Item
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
- Structural properties of twin-free graphs
- Codes identifying sets of vertices in random networks
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
- Approximation algorithms for combinatorial problems
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Approximation algorithms for the test cover problem
- On the identification of vertices using cycles
- Complexity of approximating bounded variants of optimization problems
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
- Extremal graphs for the identifying code problem
- Watching systems in graphs: an extension of identifying codes
- Induced subsets
- On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths
- On a new class of codes for identifying vertices in graphs
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- Identifying Codes in Line Graphs
This page was built for publication: Identifying path covers in graphs
