Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291)
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: Computational complexity of reconstruction and isomorphism testing for designs and line graphs |
scientific article; zbMATH DE number 5836872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of reconstruction and isomorphism testing for designs and line graphs |
scientific article; zbMATH DE number 5836872 |
Statements
Computational complexity of reconstruction and isomorphism testing for designs and line graphs (English)
0 references
14 January 2011
0 references
computational complexity
0 references
reconstructibility
0 references
isomorphism testing
0 references
combinatorial design
0 references
line graph
0 references
graph isomorphism problem
0 references
hypergraph isomorphism problem
0 references
0 references
0 references
0.8134843111038208
0 references
0.7450437545776367
0 references
0.7397454380989075
0 references
0.7295247912406921
0 references
