IDEAS home Printed from https://ideas.repec.org/p/wop/safiwp/01-10-056.html
   My bibliography  Save this paper

Circuit Bases of Strongly Connected Digraphs

Author

Listed:
  • Petra M. Gleiss
  • Josef Leydold
  • Peter F. Stadler

Abstract

The cycle space of a strongly connected graph has a basis consisting of directed circuits. The concept of relevant circuits is introduced as a generalization of the relevant cycles in undirected graphs. A polynomial time algorithm for the computation of a minimum weight directed circuit basis is outlined.

Suggested Citation

  • Petra M. Gleiss & Josef Leydold & Peter F. Stadler, 2001. "Circuit Bases of Strongly Connected Digraphs," Working Papers 01-10-056, Santa Fe Institute.
  • Handle: RePEc:wop:safiwp:01-10-056
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    References listed on IDEAS

    as
    1. Petra M. Gleiss & Peter F. Stadler & Andreas Wagner & David A. Fell, 2001. "Relevant Cycles In Chemical Reaction Networks," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 4(02n03), pages 207-226.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. David L. Alderson, 2008. "OR FORUM---Catching the “Network Science” Bug: Insight and Opportunity for the Operations Researcher," Operations Research, INFORMS, vol. 56(5), pages 1047-1065, October.
    2. Jeong, Wonhee & Yu, Unjong, 2022. "Effects of quadrilateral clustering on complex contagion," Chaos, Solitons & Fractals, Elsevier, vol. 165(P1).

    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:wop:safiwp:01-10-056. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/epstfus.html .

    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.