Algorithms and complexity for geodetic sets on partial grids
From MaRDI portal
Publication:6057850
DOI10.1016/j.tcs.2023.114217OpenAlexW4387008148MaRDI QIDQ6057850
Bodhayan Roy, Dibyayan Chakraborty, Harmender Gahlawat
Publication date: 26 October 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114217
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for the longest path problem in rectangular grid graphs
- Hardness and approximation for the geodetic set problem in some graph classes
- Some remarks on the geodetic number of a graph
- Interval representations of planar graphs
- Unit disk graphs
- The geodetic number of a graph
- On the hardness of finding the geodetic number of a subcubic graph
- On the Steiner, geodetic and hull numbers of graphs
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Face covers and the genus problem for apex graphs
- Well-partitioned chordal graphs
- The edge geodetic number of product graphs
- Geodesic Convexity in Graphs
- Computing Minimum Geodetic Sets of Proper Interval Graphs
- Block decomposition approach to compute a minimum geodetic set
- An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
- Convexity in Graphs and Hypergraphs
- Universality considerations in VLSI circuits
- On The Edge Geodetic Number Of A Graph
- Geodetic sets in graphs
- Parameterized Complexity of Geodetic Set
- Edge geodetic number of a graph
- Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs
This page was built for publication: Algorithms and complexity for geodetic sets on partial grids
