Algorithms for unipolar and generalized split graphs (Q741738)
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 6344083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for unipolar and generalized split graphs |
scientific article; zbMATH DE number 6344083 |
Statements
Algorithms for unipolar and generalized split graphs (English)
0 references
12 September 2014
0 references
split graph
0 references
clique-split graph
0 references
unipolar graph
0 references
generalized split graph
0 references
minimal triangulation
0 references
perfect code
0 references
efficient dominating set
0 references
0 references
0 references
0 references
0 references
0.9369081258773804
0 references
0.8089790940284729
0 references
0.799389123916626
0 references
0.7873209714889526
0 references
