Quasifibrations of graphs to find symmetries and reconstruct biological networks
From MaRDI portal
(Redirected from Publication:5055404)
Recommendations
Cites work
- A new status index derived from sociometric analysis
- A survey on tree edit distance and related problems
- Axioms for Centrality
- Directed scale-free graphs
- Fibrations of graphs
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
- Modern algorithms of cluster analysis
- Nonlinear dynamics of networks: the groupoid formalism
- Partitioning a graph in \(O(|A|\log_ 2|V|)\)
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization
- The partition problem
- Three Partition Refinement Algorithms
- Tight lower and upper bounds for the complexity of canonical colour refinement
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
This page was built for publication: Quasifibrations of graphs to find symmetries and reconstruct biological networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055404)