Name
Abstract | ||
|---|---|---|
Several authors have demonstrated how reductions can be used to improve the efficiency with which the Steiner Problem in Graphs can be solved. Previous reduction algorithms have been largely ad hoc in nature. This paper uses a theory of confluence to show that, in many cases, all maximal reduction sequences are equivalent, gaining insights into the design of reduction algorithms that obtain a maximum degree of reduction. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S1570-8667(03)00008-X | J. Discrete Algorithms |
Keywords | Field | DocType |
previous reduction algorithm,reduction,maximum degree,reduction algorithm,steiner problem,maximal reduction sequence | Discrete mathematics,Graph,Combinatorics,Steiner tree problem,Reduction (complexity),Degree (graph theory),Confluence,Mathematics | Journal |
Volume | Issue | ISSN |
1 | 1 | Journal of Discrete Algorithms |
Citations | PageRank | References |
1 | 0.40 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeffrey H. Kingston | 1 | 336 | 38.79 |
| Nicholas Paul Sheppard | 2 | 285 | 25.84 |