Topics in Graph Automorphisms and Reconstruction

By J. Lauri, R. Scapellato. 2003

190 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/d20f28b241257436b089c5b1953e6a1dd0a09fee

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Magnus Egerstedt
2. M. Tamer Özsu
3. Ali Reza Ashrafi
4. Mehran Mesbahi
5. Zeinab Mehranian
6. Ahmad Gholami

In Computer Vision and Pattern Recognition

1. Magnus Egerstedt
2. Ali Reza Ashrafi
3. Zeinab Mehranian
4. Ahmad Gholami
5. Lei Chen
6. Veysel Gazi
7. Jason Lines
8. Anthony J. Bagnall

In Discrete Mathematics and Combinatorics

1. Ali Reza Ashrafi
2. Mehran Mesbahi
3. Zeinab Mehranian
4. Ahmad Gholami

Citations in the corpus

• K-Automorphism: A General Framework For Privacy Preserving Network Publication (2009, background): “The high symmetry property [20, 12, 17] of real networks guarantees that KM algorithm introduces fewer noisy edges to satisfy k-automorphism model and the worst case bound is unlikely to be reached.”
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective (2009, background): “In Figure 4, the subgraph shown by solid lines, Gf , is the smallest asymmetric graph [21], in the sense that it does not admit any nonidentity automorphism.”
• A note on the power graph of a finite group (2016, methodology): “Groups linked with graphs have been arguably the most famous and productive area of algebraic graph theory, see [1, 11] for details.”