Tractable connected domination for restricted bipartite graphs (extended abstract) (Q4925288)
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: Tractable connected domination for restricted bipartite graphs (extended abstract) |
scientific article; zbMATH DE number 6174201
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tractable connected domination for restricted bipartite graphs (extended abstract) |
scientific article; zbMATH DE number 6174201 |
Statements
Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract) (English)
0 references
11 June 2013
0 references
connected domination
0 references
polynomial time
0 references
circular-convex bipartite graph
0 references
triad-convex bipartite graph
0 references
convex bipartite graph
0 references
0.9814398288726808
0 references
0.8500655889511108
0 references
0.8247258067131042
0 references
0.8208417296409607
0 references
0.815551221370697
0 references
