Weighted connected domination and Steiner trees in distance-hereditary graphs (extended abstract)

DOI10.1007/3-540-61576-8_72zbMATH Open1540.05086MaRDI QIDQ6567669FDOQ6567669

Gerard Jennhwa Chang, Hong-Gwa Yeh

Publication date: 5 July 2024

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Cites Work

• Complement reducible graphs
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Distance-hereditary graphs
• Dominating sets in perfect graphs
• Title not available (Why is that?)

This page was built for publication: Weighted connected domination and Steiner trees in distance-hereditary graphs (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567669)