Login / Signup
Efficient parameterized algorithms on graphs with heterogeneous structure: Combining tree-depth and modular-width.
Stefan Kratsch
Florian Nelles
Published in:
CoRR (2022)
Keyphrases
</>
indexing structure
computationally efficient
tree structure
minimum spanning tree
learning algorithm
worst case
computationally expensive
graph theory
graph structure
computationally intensive
optimization problems
hierarchical structure
highly efficient
data structure
lower bound
network structure