Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs.
Frederic DornFedor V. FominDaniel LokshtanovVenkatesh RamanSaket SaurabhPublished in: Inf. Comput. (2013)
Keyphrases
- directed graph
- theoretical analysis
- data structure
- times faster
- computational complexity
- maximum flow
- optimization problems
- computationally efficient
- graph theory
- recently developed
- computationally expensive
- combinatorial optimization
- strongly connected
- data mining
- web graph
- directed acyclic graph
- computational efficiency
- orders of magnitude
- benchmark datasets
- special case
- significant improvement
- search algorithm