Algorithms and hardness for geodetic set on tree-like digraphs
From MaRDI portal
Cites work
- Algorithms and complexity for geodetic sets on partial grids
- Algorithms and hardness for Metric Dimension on digraphs
- Computing minimum geodetic sets of proper interval graphs
- Convexity in Graphs and Hypergraphs
- Enumerating minimal solution sets for metric graph problems
- Extremal Digraphs for open neighbourhood location-domination and identifying codes
- Geodesic Convexity in Graphs
- Geodetic spectra of graphs.
- Hardness and approximation for the geodetic set problem in some graph classes
- 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?)
- Hull and geodetic numbers for some classes of oriented graphs
- Metric dimension and geodetic set parameterized by vertex cover
- Monitoring edge-geodetic sets in graphs
- On the approximation hardness of geodetic set and its variants
- Orientable convexity, geodetic and hull numbers in graphs
- Parameterized algorithms
- Parameterized complexity of geodetic set
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar 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
- The geodetic number of a graph
- The geodetic number of an oriented graph
- The geodetic numbers of graphs and digraphs
- The hull number of an oriented graph
- The upper and lower geodetic numbers of graphs.
- Well-partitioned chordal graphs
This page was built for publication: Algorithms and hardness for geodetic set on tree-like digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307320)
