Minimum geodetic set is NP-complete for directed acyclic planar geodetic graphs, but solvable in linear time for directed series-parallel graphs.
Lawler , title =
2 Pith papers cite this work, alongside 611 external citations. Polarity classification is still indexing.
2
Pith papers citing it
611
external citations · OpenAlex
years
2026 2representative citing papers
In non-modular polymatroidal service markets, revenue-optimal DSIC mechanisms cannot also be credible for strategic operators, with tight welfare-loss bounds on the Cost of Non-Credibility across network topologies.
citing papers explorer
-
Geodetic sets for directed acyclic planar geodetic graphs
Minimum geodetic set is NP-complete for directed acyclic planar geodetic graphs, but solvable in linear time for directed series-parallel graphs.
-
Credibility Trilemma in Polymatroidal Service Markets
In non-modular polymatroidal service markets, revenue-optimal DSIC mechanisms cannot also be credible for strategic operators, with tight welfare-loss bounds on the Cost of Non-Credibility across network topologies.