A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph (Q2446306)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6286023
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph |
scientific article; zbMATH DE number 6286023 |
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
0.917094886302948
0 references
0.9170582294464112
0 references
0.8684173822402954
0 references
0.8594579100608826
0 references
0.8510465621948242
0 references
