Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q5369516)
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 6792390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs |
scientific article; zbMATH DE number 6792390 |
Statements
17 October 2017
0 references
vertex-partition problems
0 references
monopolar graphs
0 references
subcolorings
0 references
split graphs
0 references
unipolar graphs
0 references
fixed-parameter algorithms
0 references
0.9407444596290588
0 references
0.8189134001731873
0 references
0.8153318166732788
0 references
0.8047135472297668
0 references
0.799389123916626
0 references
