The geodesic-transversal problem
From MaRDI portal
Publication:2246468
DOI10.1016/j.amc.2021.126621OpenAlexW3199925970MaRDI QIDQ2246468
Boštjan Brešar, Sandi Klavžar, Paul D. Manuel
Publication date: 16 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.08042
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Geodesic transversal problem for join and lexicographic product of graphs ⋮ Geodesic packing in graphs ⋮ The geodesic transversal problem on some networks
Cites Work
- Unnamed Item
- Unnamed Item
- Kernelization of the 3-path vertex cover problem
- On the weighted \(k\)-path vertex cover problem
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
- Reconfiguring \(k\)-path vertex covers
- Clique-transversal sets of line graphs and complements of line graphs
- A faster FPT algorithm for 3-path vertex cover
- The complexity of generalized clique covering
- Transversal partitioning in balanced hypergraphs
- Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Algorithmic aspects of clique-transversal and clique-independent sets
- On a relation between \(k\)-path partition and \(k\)-path vertex cover
- A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs
- Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems
- Minimum \(k\)-path vertex cover
- Parameterized algorithm for 3-path vertex cover
- The vertex cover \(P_3\) problem in cubic graphs
- On the vertex \(k\)-path cover
- A Kuratowski-type theorem for the maximum genus of a graph
- Node-Deletion Problems on Bipartite Graphs
- Uniformly dissociated graphs
This page was built for publication: The geodesic-transversal problem
