Algorithm of acyclic dominating set problem on bipartite permutation graphs

zbMATH Open1093.05053MaRDI QIDQ5469725FDOQ5469725

Authors: Guangjun Xu, Min Zhao, Liying Kang 

Publication date: 26 May 2006

Recommendations

• Acyclic domination on bipartite permutation graphs
• An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
• Acyclic domination
• Edge domination on bipartite permutation graphs and cotriangulated graphs
• scientific article; zbMATH DE number 1222845

zbMATH Keywords

acyclic domination number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (4)

• Acyclic domination on bipartite permutation graphs
• An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
• Acyclically pushable bipartite permutation digraphs: an algorithm
• An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs

This page was built for publication: Algorithm of acyclic dominating set problem on bipartite permutation graphs

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