摘要: Structural parameters for undirected graphs such as the path-width or tree-width of graphs have played a crucial role in developing a structure theory for graphs based on the minor …
springer.com
sci-hub.se 参考文章(100)
Bradley Sheppard, DNA sequencing by hybridization Memorial University of Newfoundland. ,(2014)
B A Reed, Surveys in Combinatorics, 1997: Tree Width and Tangles: A New Connectivity Measure and Some Applications Cambridge University Press. pp. 87- 162 ,(1997) , 10.1017/CBO9780511662119.006
Hisao Tamaki, A Polynomial Time Algorithm for Bounded Directed Pathwidth Graph-Theoretic Concepts in Computer Science. pp. 331- 342 ,(2011) , 10.1007/978-3-642-25870-1_30
Roman Rabinovich, Erich Grädel, Graph complexity measures and monotonicity Publikationsserver der RWTH Aachen University. ,(2014)
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, DAG-Width and parity games symposium on theoretical aspects of computer science. pp. 524- 536 ,(2006) , 10.1007/11672142_43
Wolfgang Espelage, Frank Gurski, Egon Wanke, How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time workshop on graph theoretic concepts in computer science. pp. 117- 128 ,(2001) , 10.1007/3-540-45477-2_12
Brian Alspach, SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEY Le Matematiche. ,vol. 59, pp. 5- 37 ,(2006)
Dietmar Berwanger, Erich Grädel, Entanglement – A Measure for the Complexity of Directed Graphs with Applications to Logic and Games international conference on logic programming. pp. 209- 223 ,(2005) , 10.1007/978-3-540-32275-7_15
Jörg Flum, Martin Grohe, Parameterized complexity theory Springer. ,(2010)
Mohammad Ali Safari, D-Width: A More Natural Measure for Directed Tree Width Mathematical Foundations of Computer Science 2005. pp. 745- 756 ,(2005) , 10.1007/11549345_64