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
- Version:
- Publisher's version
Actions
Access Document
- Files:
-
-
(pdf, 406.9KB)
-
- Publisher copy:
- 10.1016/j.tcs.2008.02.038
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
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-05
- DOI:
- ISSN:
-
0304-3975
- URN:
-
uuid:6dd728d5-d2f7-4911-9499-3e76990cff4b
- Local pid:
- ora:10786
Item Description
- Language:
- English
- Keywords:
- Subjects:
Terms of use
- Copyright holder:
- Elsevier B.V.
- 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/
If you are the owner of this record, you can report an update to it here: Report update to this record