Login / Signup
On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems.
Ramin Javadi
Amir Nikabadi
Published in:
Discret. Appl. Math. (2024)
Keyphrases
</>
parameterized complexity
np complete
shortest path
fixed parameter tractable