article · Theoretical Computer Science · 2011

Digraph decompositions and monotonicity in digraph searching

Cited by 22Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Kreutzer, S., & Ordyniak, S. (2011). Digraph decompositions and monotonicity in digraph searching. Theoretical Computer Science, 412(35), 4688–4703. https://doi.org/10.1016/j.tcs.2011.05.003

MLA 9

Kreutzer, Stephan, and Sebastian Ordyniak. “Digraph decompositions and monotonicity in digraph searching.” Theoretical Computer Science, vol. 412, no. 35, 2011, pp. 4688–703, https://doi.org/10.1016/j.tcs.2011.05.003.

Chicago

Kreutzer, Stephan, and Sebastian Ordyniak. 2011. “Digraph decompositions and monotonicity in digraph searching.” Theoretical Computer Science 412 (35): 4688–703. https://doi.org/10.1016/j.tcs.2011.05.003.

Harvard

Kreutzer, S. and Ordyniak, S. (2011) ‘Digraph decompositions and monotonicity in digraph searching’, Theoretical Computer Science, 412(35), pp. 4688–4703. Available at: https://doi.org/10.1016/j.tcs.2011.05.003.

BibTeX

@article{kreutzer2011digraph,
  title = {{Digraph decompositions and monotonicity in digraph searching}},
  author = {Kreutzer, Stephan and Ordyniak, Sebastian},
  journal = {Theoretical Computer Science},
  volume = {412},
  number = {35},
  pages = {4688--4703},
  year = {2011},
  doi = {10.1016/j.tcs.2011.05.003}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.