Linear algorithms for red and blue domination in convex bipartite graphs
type: Item
instance of: scholarly article
title: Linear algorithms for red and blue domination in convex bipartite graphs
DOI: 10.1007/978-3-030-79987-8_3
author: Nesrine Abbas
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7495012
zbMATH Keywords: convex bipartite graph
zbMATH Keywords: red dominating set
zbMATH Keywords: blue dominating set
MaRDI profile type: Publication
full work available at URL: 978-3-030-79987-8 3
OpenAlex ID: W3174975592
cites work: Enumerating minimal dominating sets in chordal bipartite graphs
cites work: An exact algorithm for connected red-blue dominating set
cites work: Domination in convex and chordal bipartite graphs
cites work: A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
cites work: Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
cites work: Independent Domination on Tree Convex Bipartite Graphs
cites work: Domination in Some Subclasses of Bipartite Graphs
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Graph Classes: A Survey
cites work: Q3679215
description: scientific article; zbMATH DE number 7495012