The parallel complexity of signed graphs: Decidability results and an improved algorithm (Q1019708)
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 5561679
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The parallel complexity of signed graphs: Decidability results and an improved algorithm |
scientific article; zbMATH DE number 5561679 |
Statements
The parallel complexity of signed graphs: Decidability results and an improved algorithm (English)
0 references
4 June 2009
0 references
ciliates
0 references
parallel gene assembly
0 references
parallel complexity
0 references
signed graphs
0 references
algorithm
0 references
decidability
0 references
0.9363971948623656
0 references
0.9348756074905396
0 references
0.9145116209983826
0 references
0.7652071714401245
0 references
0.7362205982208252
0 references
