• Title of article

    Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs

  • Author/Authors

    Detti، نويسنده , , Paolo and Meloni، نويسنده , , Carlo and Pranzo، نويسنده , , Marco، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2004
  • Pages
    6
  • From page
    117
  • To page
    122
  • Abstract
    Given a graph G, the Minimum Dominating Trail Set (MDTS) problem consists in finding a minimum cardinality collection of pairwise edge-disjoint trails such that each edge of G has at least one endvertex on some trail. The MDTS problem is NP–hard for general graphs. In this paper an algorithmic approach for the MDTS problem on (two-terminal) series parallel graphs is presented.
  • Keywords
    graph algorithms , series parallel graphs , edge domination
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Serial Year
    2004
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Record number

    1453687

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1453687