IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v36y2018i4d10.1007_s10878-017-0238-6.html
   My bibliography  Save this article

Finding disjoint paths on edge-colored graphs: more tractability results

Author

Listed:
  • Riccardo Dondi

    (Università degli Studi di Bergamo)

  • Florian Sikora

    (PSL Research University, CNRS, LAMSADE)

Abstract

The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph (called MaxCDP) has been recently introduced in literature, motivated by applications in social network analysis. In this paper we investigate how the complexity of the problem depends on graph parameters (namely the number of vertices to remove to make the graph a collection of disjoint paths and the size of the vertex cover of the graph), which makes sense since graphs in social networks are not random and have structure. The problem was known to be hard to approximate in polynomial time and not fixed-parameter tractable (FPT) for the natural parameter. Here, we show that it is still hard to approximate, even in FPT-time. Finally, we introduce a new variant of the problem, called MaxCDDP, whose goal is to find the maximum number of vertex-disjoint and color-disjoint uni-color paths. We extend some of the results of MaxCDP to this new variant, and we prove that unlike MaxCDP, MaxCDDP is already hard on graphs at distance two from disjoint paths.

Suggested Citation

  • Riccardo Dondi & Florian Sikora, 2018. "Finding disjoint paths on edge-colored graphs: more tractability results," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1315-1332, November.
    • Handle: RePEc:spr:jcomop:v:36:y:2018:i:4:d:10.1007_s10878-017-0238-6
    DOI: 10.1007/s10878-017-0238-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0238-6
    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-017-0238-6?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.

    References listed on IDEAS

    as
    1. Rafael F. Santos & Alessandro Andrioni & Andre C. Drummond & Eduardo C. Xavier, 2017. "Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 742-778, 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. Kai Yang & Cong Tian & Nan Zhang & Zhenhua Duan & Hongwei Du, 2019. "A temporal logic programming approach to planning," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 402-420, 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:spr:jcomop:v:36:y:2018:i:4:d:10.1007_s10878-017-0238-6. 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: 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.