On partitioning a graph into two connected subgraphs (Q650911)
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: On partitioning a graph into two connected subgraphs |
scientific article; zbMATH DE number 5987002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On partitioning a graph into two connected subgraphs |
scientific article; zbMATH DE number 5987002 |
Statements
On partitioning a graph into two connected subgraphs (English)
0 references
7 December 2011
0 references
disjoint connected subgraphs
0 references
dominating set
0 references
exact algorithm
0 references
0.99999994
0 references
0.9544543
0 references
0.9521265
0 references
0.9466147
0 references
0.9380311
0 references
0.9380311
0 references
0 references
0 references
0.9312539
0 references
