A directed weighted two-graph model separates feasibility from movement in solution discovery and yields a detailed complexity classification for path and shortest-path discovery.
7 Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
A directed weighted two-graph model separates feasibility from movement in solution discovery and yields a detailed complexity classification for path and shortest-path discovery.