Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis (Q6535518)
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: Computing k-bisimulations for large graphs: a comparison and efficiency analysis |
scientific article; zbMATH DE number 7787539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis |
scientific article; zbMATH DE number 7787539 |
Statements
Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis (English)
0 references
12 January 2024
0 references
structural graph summarization
0 references
bisimulation
0 references
large labeled graphs
0 references
0 references
0.7661768198013306
0 references
0.7356866598129272
0 references
0.723702073097229
0 references
0.7170831561088562
0 references
0.7127235531806946
0 references
