Parameterized Complexity of Geodetic Set
From MaRDI portal
Publication:6089667
Cites work
- scientific article; zbMATH DE number 7650213 (Why is no real title available?)
- A survey of the algorithmic aspects of modular decomposition
- Computational Complexity of Geodetic Set
- Hardness and approximation for the geodetic set problem in some graph classes
- Hull number: \(P_5\)-free graphs and reduction rules
- Integer Programming with a Fixed Number of Variables
- Linear time solvable optimization problems on graphs of bounded clique-width
- Metric Dimension of Bounded Tree-length Graphs
- Metric dimension parameterized by max leaf number
- Notes on complexity of packing coloring
- On the Relationship Between Clique-Width and Treewidth
- On the geodetic number and related metric sets in Cartesian product graphs
- On the hardness of finding the geodetic number of a subcubic graph
- On the parameterized complexity of the geodesic hull number
- Some remarks on the geodetic number of a graph
- Sparsity. Graphs, structures, and algorithms
- The (weighted) metric dimension of graphs: hard and easy cases
- The geodetic hull number is hard for chordal graphs
Cited in
(9)- On graphs coverable by \({k}\) shortest paths
- Geometric complexity of some location problems
- Well-partitioned chordal graphs
- Algorithms and complexity for geodetic sets on partial grids
- Length-bounded cuts: proper interval graphs and structural parameters
- scientific article; zbMATH DE number 7765365 (Why is no real title available?)
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Block decomposition approach to compute a minimum geodetic set
This page was built for publication: Parameterized Complexity of Geodetic Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089667)
