scientific article; zbMATH DE number 1303039

zbMATH Open0923.05032MaRDI QIDQ4249540FDOQ4249540

Authors: Yaw-Ling Lin 

Publication date: 17 June 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

dominating settrapezoid graphsindependent domination problem

Mathematics Subject Classification ID

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

Cited In (10)

• An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs
• Efficient algorithms for the minimum connected domination on trapezoid graphs
• Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
• A dichotomy for weighted efficient dominating sets with bounded degree vertices
• Improved bottleneck domination algorithms
• On efficient domination for some classes of \(H\)-free chordal graphs
• Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
• Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
• Efficient domination for classes of \(P_6\)-free graphs
• Title not available (Why is that?)

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)