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

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

Gerard Jennhwa Chang, Hong-Gwa Yeh

Publication date: 5 July 2024

Mathematics Subject Classification ID

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

Cites Work

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

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)