A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph (Q2446306)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph |
scientific article |
Statements
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph (English)
0 references
16 April 2014
0 references
paired-domination
0 references
perfect matching
0 references
convex bipartite graphs
0 references
0 references
