Efficient algorithms for the minimum connected domination of trapezoid graphs

DOI10.1007/3-540-44968-X_13MaRDI QIDQ2766821zbMATH OpenFDO

Authors Yaw-Ling Lin, Yin Te Tsai, F. R. Hsu

Publication date 14 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44968-X_13

zbMATH Keywords

dominating settrapezoid graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Efficient algorithms for the minimum connected domination on trapezoid graphs
• Fast algorithms for independent domination and efficient domination in trapezoid graphs
• Connected domination and dominating clique in trapezoid graphs
• Parallel algorithms for the domination problems in trapezoid graphs
• Hamilton cycles in split graphs with large minimum degree

Cited in

(7)

• Parallel algorithms for the domination problems in trapezoid graphs
• Connected domination and dominating clique in trapezoid graphs
• An efficient algorithm to solve connectivity problem on trapezoid graphs
• scientific article; zbMATH DE number 992410 (Why is no real title available?)
• Efficient algorithm for the vertex connectivity of trapezoid graphs
• Fast algorithms for independent domination and efficient domination in trapezoid graphs
• Efficient algorithms for the minimum connected domination on trapezoid graphs

This page was built for publication: Efficient algorithms for the minimum connected domination of trapezoid graphs

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