DAG-width: connectivity measure for directed graphs
暂无分享,去创建一个
[1] Robin Thomas,et al. Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.
[2] Hans L. Bodlaender,et al. Complexity of Path-Forming Games , 1993, Theor. Comput. Sci..
[3] Jan Obdrzálek,et al. Fast Mu-Calculus Model Checking when Tree-Width Is Bounded , 2003, CAV.
[4] Robin Thomas,et al. Directed Tree-Width , 2001, J. Comb. Theory, Ser. B.
[5] B. Reed. Surveys in Combinatorics, 1997: Tree Width and Tangles: A New Connectivity Measure and Some Applications , 1997 .
[6] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..
[7] Bruce A. Reed,et al. Introducing Directed Tree Width , 1999, Electron. Notes Discret. Math..
[8] Hans L. Bodlaender,et al. Treewidth: Algorithmic Techniques and Results , 1997, MFCS.
[9] Paul D. Seymour,et al. Graph minors. III. Planar tree-width , 1984, J. Comb. Theory, Ser. B.