Entanglement and the complexity of directed graphs
Authors:
- Dietmar BerwangerDBDietmar Berwanger
- Łukasz KaiserŁKŁukasz Kaiser
- 1 December 2012
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 463, 2-25
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The dag-width of directed graphsJournal of Combinatorial Theory, Series B, 2012
- Digraph measures: Kelly decompositions, games, and orderingsTheoretical Computer Science, 2008
- The Variable Hierarchy of the μ-Calculus Is StrictTheory of Computing Systems, 2007
- Directed Tree-WidthJournal of Combinatorial Theory, Series B, 2001
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- AlternationJournal of the ACM, 1981
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- Transition graphs and the star-height of regular events.The Michigan Mathematical Journal, 1963