No article text was recorded for this version.
geodetic set complexity
Version 1 of 114 papers29 conceptsfrozen 2026-10-04
Papers in this version
- Blog: The Complexity of Tree Partitioning
- Blog: Covering and Partitioning of Split, Chain and Cographs with Isometric Paths
- Blog: On Finding Minimal w-cutset
- Blog: Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond
- Blog: The vertex k-cut problem
- Blog: The Closed Geodetic Game: algorithms and strategies
- Blog: Algorithms and complexity for geodetic sets on partial grids
- Blog: (1, j)-set problem in graphs
- Blog: Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs
- Blog: On the Structure of Hamiltonian Graphs with Small Independence Number
- Blog: Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs
- Blog: Hardness and approximation for the geodetic set problem in some graph classes
- Blog: Polynomial-Time Algorithms for Path Cover on Trees and Graphs of Bounded Treewidth
- Blog: Parameterized Complexity of Geodetic Set
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_geodetic_set_complexity_57042029,
title = {geodetic set complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/geodetic-set-complexity/rdr_5704202968174c539896bef93413accc},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_geodetic_set_complexity_57042029_v1,
title = {geodetic set complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/geodetic-set-complexity/rdr_5704202968174c539896bef93413accc/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}