D-width: A more natural measure for directed tree width

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 745-756

  Safari, Mohammad Ali ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PARAMETER ESTIMATION; THEOREM PROVING;

DIGRAPHS; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 26844575210     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_64     Document Type: Conference Paper

References (10)

1. [BD02] P. Bellenbaum and R. Diestel. Two short proofs concerning tree-decompositions. Combinatoric, Probability and Computing, 11:1-7, 2002.
2. [Bod93] H. L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, pages 1-21, 1993.
3. [JRST01] T. Johnson, N. Robertson, P. D. Seymour, and R. Thomas. Directed Tree-Width. Journal of Combinatorial Theory(Series B), 82:128-154, 2001.
4. [Ree97] B. Reed. Tree Width and Tangles: A New Connectivity Measure And Some Applications. Suervey in Combinatorics, 241:87-158, 1997.
5. [Ree00] B. Reed. Introducing directed tree width. In H.J. Broersma, U. Faigle, C. Hoede, and J.L. Hurink, editors, Electronic Notes in Discrete Mathematics, volume 3. Elsevier, 2000.
6. [RRST96] B. Reed, N. Robertson, P. Seymour, and R. Thomas. On packing directed circuits. Combinatorica, 16:535-554, 1996.
7. [RS86] N. Robertson and P. D. Seymour. Graph minors II: algorithmic aspects of tree-width. Journal Algorithms, 7:309-322, 1986.
8. [Saf03] M.A. Safari. Directed tree-width. Master's thesis, School of Computer Science, University of Waterloo, 2003.
9. [ST93] P. Seymour and R. Thomas. Graph searching, and a min-max theorem for treewidth. Journal of Combinatorial Theory (Series B), 58:239-257, 1993.
10. [You73] D. H. Younger. Graphs with interlinked directed circuits. In Proceedings of the Mid-west Symposium on Circuit Theory, volume 2, pages XVI 2.1-XVI 2.7, 1973.