IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v25y2013i3d10.1007_s10878-010-9373-z.html
   My bibliography  Save this article

Computing maximum upward planar subgraphs of single-source embedded digraphs

Author

Listed:
  • Aimal Rextin

    (National University of Sciences and Technology (NUST))

  • Patrick Healy

    (University of Limerick)

Abstract

We show how to compute a maximum upward planar single-source subgraph of a single-source embedded DAG G φ . We first show that finding a maximum upward planar subgraph of a single-source embedded digraph is NP-complete. We then give a new characterization of upward planar single-source digraphs. We use this characterization to present an algorithm that computes a maximum upward planar single-source subgraph of a single-source embedded DAG. This algorithm takes O(n 4) time in the worst case and O(n 3) time on average.

Suggested Citation

  • Aimal Rextin & Patrick Healy, 2013. "Computing maximum upward planar subgraphs of single-source embedded digraphs," Journal of Combinatorial Optimization, Springer, vol. 25(3), pages 368-392, April.
    • Handle: RePEc:spr:jcomop:v:25:y:2013:i:3:d:10.1007_s10878-010-9373-z
    DOI: 10.1007/s10878-010-9373-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9373-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-010-9373-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:25:y:2013:i:3:d:10.1007_s10878-010-9373-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.