scientific article; zbMATH DE number 1303039

MaRDI QIDQ4249540zbMATH OpenFDO

Authors Yaw-Ling Lin

Publication date 17 June 1999

zbMATH Keywords

dominating setindependent domination problemtrapezoid graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Efficient algorithms for the minimum connected domination on trapezoid graphs
• scientific article; zbMATH DE number 1696629
• Parallel algorithms for the domination problems in trapezoid graphs

Cited in

(12)

• Parallel algorithms for the domination problems in trapezoid graphs
• A dichotomy for weighted efficient dominating sets with bounded degree vertices
• Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
• Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
• Efficient domination for classes of \(P_6\)-free graphs
• Improved bottleneck domination algorithms
• scientific article; zbMATH DE number 1696629 (Why is no real title available?)
• Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
• On efficient domination for some classes of \(H\)-free chordal graphs
• An efficient algorithm for finding a maximum weight k-independent set of trapezoid graphs
• A study on the weighted efficient domination problem for C₄-free bipartite graphs
• Efficient algorithms for the minimum connected domination on trapezoid graphs

This page was built for publication:

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