IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v35y2023i6p1404-1418.html
   My bibliography  Save this article

Recognizing Series-Parallel Matrices in Linear Time

Author

Listed:
  • Matthias Walter

    (Department of Applied Mathematics, University of Twente, 7522 NB Enschede, Netherlands)

Abstract

A series-parallel matrix is a binary matrix that can be obtained from an empty matrix by successively adjoining rows or columns that are copies of an existing row/column or have at most one one-entry. Equivalently, series-parallel matrices are representation matrices of graphic matroids of series-parallel graphs, which can be recognized in linear time. We propose an algorithm that, for an m -by- n matrix A with k nonzeros, determines in expected time whether A is series-parallel or returns a minimal non–series-parallel submatrix of A . We complement the developed algorithm by an efficient O ( m + n + k ) implementation and report about computational results.

Suggested Citation

  • Matthias Walter, 2023. "Recognizing Series-Parallel Matrices in Linear Time," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1404-1418, November.
    • Handle: RePEc:inm:orijoc:v:35:y:2023:i:6:p:1404-1418
    DOI: 10.1287/ijoc.2021.0233
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2021.0233
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2021.0233?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
    ---><---

    References listed on IDEAS

    as
    1. Wei Chen & Milind Dawande & Ganesh Janakiraman, 2014. "Integrality in Stochastic Inventory Models," Production and Operations Management, Production and Operations Management Society, vol. 23(9), pages 1646-1663, September.
    2. Robert E. Bixby & Donald K. Wagner, 1988. "An Almost Linear-Time Algorithm for Graph Realization," Mathematics of Operations Research, INFORMS, vol. 13(1), pages 99-123, February.
    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. Tan Wang & L. Jeff Hong, 2023. "Large-Scale Inventory Optimization: A Recurrent Neural Networks–Inspired Simulation Approach," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 196-215, January.
    2. Ahmed Redha Mahlous, 2017. "SCMC: An Efficient Scheme for Minimizing Energy in WSNs Using a Set Cover Approach," Future Internet, MDPI, vol. 9(4), pages 1-18, December.
    3. Yang Bo & Milind Dawande & Ganesh Janakiraman & S. Thomas McCormick, 2017. "On Integral Policies in Deterministic and Stochastic Distribution Systems," Operations Research, INFORMS, vol. 65(3), pages 703-711, June.
    4. Ali, Agha Iqbal & Han, Hyun-Soo, 1998. "Computational implementation of Fujishige's graph realizability algorithm," European Journal of Operational Research, Elsevier, vol. 108(2), pages 452-463, July.
    5. Xujin Chen & Zhibin Chen & Wenan Zang, 2010. "A Unified Approach to Box-Mengerian Hypergraphs," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 655-668, August.

    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:inm:orijoc:v:35:y:2023:i:6:p:1404-1418. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.