Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths.
Daniel LokshtanovSaket SaurabhMeirav ZehaviPublished in: Treewidth, Kernels, and Algorithms (2020)
Keyphrases
- computationally expensive
- graph theory
- disjoint paths
- computational cost
- computationally efficient
- random walk
- mathematical foundations
- computational complexity
- depth first search
- graph search
- maximum flow
- partitioning algorithm
- graph structure
- highly efficient
- computationally intensive
- minimum spanning tree
- pruning strategy
- random graphs