Login / Signup
Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems.
Eduard Eiben
Diptapriyo Majumdar
M. S. Ramanujan
Published in:
CoRR (2023)
Keyphrases
</>
optimization problems
partial solutions
learning algorithm
optimization criteria
highly connected
markov chain
computational complexity
knowledge discovery
np complete
random walk
social network analysis
directed graph
minimum cost
polynomial time complexity