Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs

@article{Dorn2013BeyondBP,
  title={Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs},
  author={Frederic Dorn and Fedor V. Fomin and Daniel Lokshtanov and Venkatesh Raman and Saket Saurabh},
  journal={Inf. Comput.},
  year={2013},
  volume={233},
  pages={60-70}
}
In 2000 Alber et al. [ SWAT 2000] obtained the first parameterized subexponential algorith m on undirected planar graphs by showing that k-DOMINATING SET is solvable in time2O( √ k)nO(1), wheren is the input size. This result triggered an extensive study o f parameterized problems on planar and more general classes of sparse graphs and culmina ted the creation of Bidimensionality Theory by Demaine et al. [ J. ACM 2005]. The theory utilizes deep theorems from Graph Minor Theory of Robertson and… CONTINUE READING
1 Citations
42 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 42 references

S

  • H. Fernau, F. V. Fomin, D. Lokshtanov, D. Raible
  • Saur abh, and Y. Villanger. Kernel(s) for…
  • 2009
Highly Influential
5 Excerpts

and I

  • G. Gutin, E. J. Kim
  • Razgon. Minimum leaf out-bran ching problems…
  • 2008
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…