Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.endm.2004.03.014 | Electronic Notes in Discrete Mathematics |
Keywords | DocType | Volume |
graph algorithms,edge domination,series parallel graphs | Conference | 17 |
ISSN | Citations | PageRank |
1571-0653 | 1 | 0.35 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paolo Detti | 1 | 144 | 19.55 |
| Carlo Meloni | 2 | 71 | 9.79 |
| Marco Pranzo | 3 | 307 | 22.56 |