IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v109y1998i3p672-685.html
   My bibliography  Save this article

The line index and minimum cut of weighted graphs

Author

Listed:
  • Xu, Shaoji

Abstract

No abstract is available for this item.

Suggested Citation

  • Xu, Shaoji, 1998. "The line index and minimum cut of weighted graphs," European Journal of Operational Research, Elsevier, vol. 109(3), pages 672-685, September.
    • Handle: RePEc:eee:ejores:v:109:y:1998:i:3:p:672-685
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00196-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Harary, Frank & Kabell, Jerald A., 1980. "A simple algorithm to detect balance in signed graphs," Mathematical Social Sciences, Elsevier, vol. 1(1), pages 131-136, September.
    2. Maybee, John S. & Maybee, Stuart J., 1983. "An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs," Mathematical Social Sciences, Elsevier, vol. 6(1), pages 99-103, October.
    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. Xiaolong Zheng & Daniel Zeng & Fei-Yue Wang, 2015. "Social balance in signed networks," Information Systems Frontiers, Springer, vol. 17(5), pages 1077-1095, October.
    2. Figueiredo, Rosa & Frota, Yuri, 2014. "The maximum balanced subgraph of a signed graph: Applications and solution approaches," European Journal of Operational Research, Elsevier, vol. 236(2), pages 473-487.
    3. Eduardo G. Pardo & Mauricio Soto & Christopher Thraves, 2015. "Embedding signed graphs in the line," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 451-471, February.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:109:y:1998:i:3:p:672-685. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.