C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
On the Parameterized Complexity of Edge-Linked Paths.
Neeldhara Misra
Fahad Panolan
Saket Saurabh
Published in:
CSR (2019)
Keyphrases
</>
parameterized complexity
fixed parameter tractable
global constraints
np complete
shortest path
weighted graph
database
theorem prover
computational problems
symmetry breaking