Efficient counting of square substrings in a tree (Q4909537)
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: Efficient counting of square substrings in a tree |
scientific article; zbMATH DE number 6147806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient counting of square substrings in a tree |
scientific article; zbMATH DE number 6147806 |
Statements
Efficient Counting of Square Substrings in a Tree (English)
0 references
21 March 2013
0 references
0.9918305277824402
0 references
0.8587824106216431
0 references
0.8081381916999817
0 references
0.8035023808479309
0 references
0.7814934849739075
0 references
