scientific article; zbMATH DE number 7765365
From MaRDI portal
Publication:6065396
Recommendations
- Algorithms and complexity for geodetic sets on partial grids
- Hardness and approximation for the geodetic set problem in some graph classes
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- scientific article; zbMATH DE number 139911
- Parameterized complexity of geodetic set
- Parameterized Complexity of Geodetic Set
- Geodetic sets in graphs
- Geodetic sets in graphs
- Algorithmic upper bounds for graph geodetic number
- scientific article; zbMATH DE number 5531985
Cites work
- A linear-time algorithm for the longest path problem in rectangular grid graphs
- An \(\mathcal{O}(n^4)\) time algorithm to compute the bisection width of solid grid graphs
- Computing minimum geodetic sets of proper interval graphs
- Convexity in Graphs and Hypergraphs
- Detecting fixed patterns in chordal graphs in polynomial time
- Geodesic Convexity in Graphs
- Hardness and approximation for the geodetic set problem in some graph classes
- scientific article; zbMATH DE number 5531985 (Why is no real title available?)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- Interval representations of planar graphs
- On the hardness of finding the geodetic number of a subcubic graph
- Optimality program in segment and string graphs
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Some remarks on the geodetic number of a graph
- The geodetic number of a graph
- Unit disk graphs
- Unit-length embedding of binary trees on a square grid
- Universality considerations in VLSI circuits
Cited in
(18)- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
- Well-partitioned chordal graphs
- Three problems on well-partitioned chordal graphs
- On the approximation hardness of geodetic set and its variants
- STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS
- Algorithms and complexity for geodetic sets on partial grids
- Maximum cut on interval graphs of interval count four is NP-complete
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
- Semi-proper interval graphs
- Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover
- The closed geodetic game: algorithms and strategies
- Enumerating minimal solution sets for metric graph problems
- Enumerating minimal solution sets for metric graph problems
- Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
- Complexity of maximum cut on interval graphs
- Metric dimension and geodetic set parameterized by vertex cover
- Algorithms and hardness for geodetic set on tree-like digraphs
- Geodetic set on graphs of constant pathwidth and feedback vertex set number
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065396)
