A fast parallel algorithm to recognize P4-sparse graphs (Q1382265)
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: A fast parallel algorithm to recognize P4-sparse graphs |
scientific article; zbMATH DE number 1133161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast parallel algorithm to recognize P4-sparse graphs |
scientific article; zbMATH DE number 1133161 |
Statements
A fast parallel algorithm to recognize P4-sparse graphs (English)
0 references
19 August 1998
0 references
mobile computing
0 references
group-based collaboration
0 references
automated theorem proving
0 references
networking
0 references
scheduling
0 references
cluster analysis
0 references
0.8688359260559082
0 references
0.859984815120697
0 references
0.8353903293609619
0 references
