Geodetic set on graphs of constant pathwidth and feedback vertex set number

DOI10.4230/LIPICS.IPEC.2025.28MaRDI QIDQ7356357zbMATH OpenFDO

Authors Prafullkumar Tale

Publication date 23 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2025.28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cites work

• Algorithms and complexity for geodetic sets on partial grids
• Computational Complexity of Geodetic Set
• Computing minimum geodetic sets of proper interval graphs
• Convexity in Graphs and Hypergraphs
• Distance-based covering problems for graphs of given cyclomatic number
• Enumerating minimal solution sets for metric graph problems
• Geodesic Convexity in Graphs
• GEODETIC GAMES FOR GRAPHS
• Hardness and approximation for the geodetic set problem in some graph classes
• Hardness of metric dimension in graphs of constant treewidth
• scientific article; zbMATH DE number 5531985 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 969092 (Why is no real title available?)
• scientific article; zbMATH DE number 7765365 (Why is no real title available?)
• Metric dimension and geodetic set parameterized by vertex cover
• Metric Dimension of Bounded Tree-length Graphs
• Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
• Metric dimension parameterized by treewidth
• Mim-width. III. Graph powers and generalized distance domination problems
• Mixed searching and proper-path-width
• On the approximation hardness of geodetic set and its variants
• On the geodetic number of a graph
• On the hardness of finding the geodetic number of a subcubic graph
• On the parameterized complexity of the geodesic hull number
• Parameterized algorithms
• Parameterized complexity of geodetic set
• Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
• Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
• Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover
• Some remarks on the geodetic number of a graph
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center
• Structurally parameterized \(d\)-scattered set
• The geodetic number of a graph
• Tight (double) exponential bounds for identification problems: locating-dominating set and test cover
• Well-partitioned chordal graphs

This page was built for publication: Geodetic set on graphs of constant pathwidth and feedback vertex set number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356357)