Polar permutation graphs are polynomial-time recognisable (Q1933641)
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: Polar permutation graphs are polynomial-time recognisable |
scientific article; zbMATH DE number 6128658
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polar permutation graphs are polynomial-time recognisable |
scientific article; zbMATH DE number 6128658 |
Statements
Polar permutation graphs are polynomial-time recognisable (English)
0 references
24 January 2013
0 references
bipartite graphs
0 references
cobipartite graphs
0 references
split graphs
0 references
matrix partitions
0 references
0.9856327772140504
0 references
0.8543688654899597
0 references
0.8495649695396423
0 references
