Linear algorithms for red and blue domination in convex bipartite graphs

DOI10.1007/978-3-030-79987-8_3OpenAlexW3174975592MaRDI QIDQ2115838

Nesrine Abbas

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_3

zbMATH Keywords

convex bipartite graphblue dominating setred dominating set

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
• An exact algorithm for connected red-blue dominating set
• Enumerating minimal dominating sets in chordal bipartite graphs
• Domination in convex and chordal bipartite graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
• Independent Domination on Tree Convex Bipartite Graphs
• Graph Classes: A Survey
• Domination in Some Subclasses of Bipartite Graphs

This page was built for publication: Linear algorithms for red and blue domination in convex bipartite graphs