Computing k-bisimulations for large graphs: a comparison and efficiency analysis

DOI10.1007/978-3-031-36709-0_12zbMATH Open1545.68098MaRDI QIDQ6535518FDOQ6535518

Authors: Jannik Rau, David Richerby, Ansgar Scherp 

Publication date: 12 January 2024

Recommendations

• Computing bisimulation-based comparisons
• An efficient algorithm for computing bisimulation equivalence
• From bisimulation to simulation: Coarsest partition problems
• An Incremental Bisimulation Algorithm
• Computing crisp bisimulations for fuzzy structures

zbMATH Keywords

bisimulationlarge labeled graphsstructural graph summarization

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Three Partition Refinement Algorithms
• CCS expressions, finite state processes, and three problems of equivalence
• A distributed algorithm for strong bisimulation reduction of state spaces
• FLUID: a common model for semantic structural graph summaries based on equivalence relations

This page was built for publication: Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535518)