Directed Tree-Width

By Thor Johnson, N. Robertson, Paul D. Seymour, R. Thomas. J. Comb. Theory B, 2001

321 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/694eae37f0b88804b3a2355b800b0acac7b31cf4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Jeannette C. M. Janssen
2. Dimitrios M. Thilikos
3. Fedor V. Fomin
4. Anthony Bonato
5. Changping Wang
6. Dexter Campbell Kozen
7. Jiong Guo
8. Rolf Niedermeier

In Computer Networks and Communications

1. Dimitrios M. Thilikos
2. Fedor V. Fomin

Citations in the corpus

• An annotated bibliography on guaranteed graph searching (2008, background): “For directed graphs, the search interpretation of directed pathwidth, directed treewidth, Kelly-width, DAG-width can be found in [16,20,97,100,125].”
• The n-ordered graphs: A new graph class (2009, background): “We warn that the notion of tree-width for 4-regular Eulerian digraphs in [11] is different from the usual treewidth or the directed tree-width [12].”