scientific article; zbMATH DE number 7765365
From MaRDI portal
Publication:6065396
DOI10.4230/lipics.isaac.2020.7arXiv2006.16511MaRDI QIDQ6065396
Bodhayan Roy, Harmender Gahlawat, Dibyayan Chakraborty, Florent Foucaud, Dimitri Lajou, Sandip Das
Publication date: 14 November 2023
Full work available at URL: https://arxiv.org/abs/2006.16511
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Well-partitioned chordal graphs ⋮ Algorithms and complexity for geodetic sets on partial grids ⋮ Maximum cut on interval graphs of interval count four is NP-complete ⋮ Three problems on well-partitioned chordal graphs ⋮ On the approximation hardness of geodetic set and its variants
Cites Work
- Unnamed Item
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- 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-length embedding of binary trees on a square grid
- Unit disk graphs
- The geodetic number of a graph
- On the hardness of finding the geodetic number of a subcubic graph
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Detecting fixed patterns in chordal graphs in polynomial time
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Geodesic Convexity in Graphs
- Computing Minimum Geodetic Sets of Proper Interval Graphs
- 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
- Optimality program in segment and string graphs
This page was built for publication:
