Article ID Journal Published Year Pages File Type
4952312 Theoretical Computer Science 2017 5 Pages PDF
Abstract
We prove that the directed treewidth, DAG-width and Kelly-width of a digraph are bounded above by its circumference plus one.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Directed width parameters and circumference of digraphs
Authors
,