Parameterized Complexity of Geodetic Set

DOI10.7155/jgaa.00601zbMath1499.68152arXiv2001.03098OpenAlexW2999989716MaRDI QIDQ5050005

Tomohiro Koana, Leon Kellerhals

Publication date: 14 November 2022

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.03098

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Algorithms and complexity for geodetic sets on partial grids ⋮ Monitoring edge-geodetic sets in graphs

Cites Work

• Hull number: \(P_5\)-free graphs and reduction rules
• Sparsity. Graphs, structures, and algorithms
• A survey of the algorithmic aspects of modular decomposition
• The (weighted) metric dimension of graphs: hard and easy cases
• Hardness and approximation for the geodetic set problem in some graph classes
• Some remarks on the geodetic number of a graph
• On the geodetic number and related metric sets in Cartesian product graphs
• Notes on complexity of packing coloring
• On the hardness of finding the geodetic number of a subcubic graph
• Linear time solvable optimization problems on graphs of bounded clique-width
• Metric dimension parameterized by treewidth
• On the parameterized complexity of the geodesic hull number
• On the geodetic hull number of \(P_{k}\)-free graphs
• Metric Dimension Parameterized by Max Leaf Number
• Integer Programming with a Fixed Number of Variables
• Computational Complexity of Geodetic Set
• The Geodetic Hull Number is Hard for Chordal Graphs
• Metric Dimension of Bounded Tree-length Graphs
• On the Relationship Between Clique-Width and Treewidth
• Parameterized Algorithms

This page was built for publication: Parameterized Complexity of Geodetic Set