Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear-time algorithm for the paired-domination problem in convex bipartite graphs |
scientific article; zbMATH DE number 6113516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-time algorithm for the paired-domination problem in convex bipartite graphs |
scientific article; zbMATH DE number 6113516 |
Statements
Linear-time algorithm for the paired-domination problem in convex bipartite graphs (English)
0 references
6 December 2012
0 references
graph algorithms
0 references
linear-time algorithms
0 references
paired-domination
0 references
total domination
0 references
convex bipartite graphs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9717954
0 references
0.93174124
0 references
0.9228734
0 references
0.92197967
0 references
0.9172909
0 references
0.91618276
0 references
0.9144885
0 references
0.9133422
0 references
0 references
