Journal article
Digraph measures: Kelly decompositions, games, and orderings
- Abstract:
-
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to digraphs. We show that on digraphs the translations of these measures are also equivalent and induce a natural connectivity measure. We introduce a decomposition for digraphs and an associated width, Kelly-width, which is equivalent to the aforementioned measure. We demonstrate its usefulness by exhibiting p...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Theoretical Computer Science Journal website
- Volume:
- 399
- Issue:
- 3
- Pages:
- 206–219
- Publication date:
- 2008-06-01
- DOI:
- ISSN:
-
0304-3975
Item Description
- Language:
- English
- Keywords:
- Subjects:
- UUID:
-
uuid:6dd728d5-d2f7-4911-9499-3e76990cff4b
- Local pid:
- ora:10786
- Deposit date:
- 2015-03-31
Related Items
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 2008
- Notes:
- Copyright 2008 Elsevier B.V. All rights reserved. Re-use of this article is permitted in accordance with the Terms and Conditions set out at http://www.elsevier.com/open-access/userlicense/1.0/
- Licence:
- Other
If you are the owner of this record, you can report an update to it here: Report update to this record