Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis
type: Item
instance of: scholarly article
title: Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis
zbMATH Open document ID: 1545.68098
DOI: 10.1007/978-3-031-36709-0_12
author: Jannik Rau
author: David Richerby
author: Ansgar Scherp
publication date: 2024-01-12T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7787539
zbMATH Keywords: structural graph summarization
zbMATH Keywords: bisimulation
zbMATH Keywords: large labeled graphs
MaRDI profile type: Publication
cites work: A distributed algorithm for strong bisimulation reduction of state spaces
cites work: FLUID: a common model for semantic structural graph summaries based on equivalence relations
cites work: CCS expressions, finite state processes, and three problems of equivalence
cites work: Three Partition Refinement Algorithms
description: scientific article; zbMATH DE number 7787539