Canonizing graphs of bounded tree width in logspace (Q4601884)
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 6829373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Canonizing graphs of bounded tree width in logspace |
scientific article; zbMATH DE number 6829373 |
Statements
24 January 2018
0 references
algorithmic graph theory
0 references
computational complexity
0 references
graph isomorphism
0 references
logspace
0 references
tree width
0 references
Canonizing Graphs of Bounded Tree Width in Logspace. (English)
0 references
0.9967359900474548
0 references
0.8815054297447205
0 references
0.8461487293243408
0 references
0.8441782593727112
0 references
0.834503173828125
0 references
