Efficient graph reachability query answering using tree decomposition (Q3584970)
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 5776501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient graph reachability query answering using tree decomposition |
scientific article; zbMATH DE number 5776501 |
Statements
Efficient Graph Reachability Query Answering Using Tree Decomposition (English)
0 references
31 August 2010
0 references
0.7578004598617554
0 references
0.7183159589767456
0 references
0.7087600231170654
0 references
