BOOK-CHAPTER

Weighted connected domination and Steiner trees in distance-hereditary graphs

Hong-Gwa YehGerard J. Chang

Year: 1996 Lecture notes in computer science Pages: 48-52   Publisher: Springer Science+Business Media
Keywords:
Combinatorics Steiner tree problem Vertex (graph theory) Computer science Vertex connectivity Chordal graph Mathematics Discrete mathematics Graph

Metrics

5
Cited By
0.47
FWCI (Field Weighted Citation Impact)
5
Refs
0.68
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Complexity and Algorithms in Graphs
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Interconnection Networks and Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

Weighted connected domination and Steiner trees in distance-hereditary graphs

Yeh Hong-GwaGerard J. Chang

Journal:   Discrete Applied Mathematics Year: 1998 Vol: 87 (1-3)Pages: 245-253
JOURNAL ARTICLE

Distance-Hereditary Graphs, Steiner Trees, and Connected Domination

Alessandro D’AtriMarina Moscarini

Journal:   SIAM Journal on Computing Year: 1988 Vol: 17 (3)Pages: 521-538
JOURNAL ARTICLE

Permutation graphs: Connected domination and Steiner trees

Charles J. ColbournLorna Stewart

Journal:   Discrete Mathematics Year: 1990 Vol: 86 (1-3)Pages: 179-189
BOOK-CHAPTER

Permutation Graphs: Connected Domination and Steiner Trees

Charles J. ColbournLorna Stewart

Annals of discrete mathematics Year: 1991 Pages: 179-189
JOURNAL ARTICLE

Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs

Hong-Gwa YehGerard J. Chang

Journal:   Theoretical Computer Science Year: 2001 Vol: 263 (1-2)Pages: 3-8
© 2026 ScienceGate Book Chapters — All rights reserved.