Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph.
Enric FloritBenjamin SmithPublished in: CoRR (2021)
Keyphrases
- graph representation
- graph theory
- graph matching
- graph structure
- labeled graphs
- directed graph
- graph databases
- graph mining
- graph construction
- weighted graph
- graph theoretic
- adjacency matrix
- graph clustering
- graph classification
- graph data
- graph theoretical
- graph properties
- random graphs
- graph transformation
- undirected graph
- spanning tree
- bipartite graph
- graph structures
- graph partitioning
- subgraph isomorphism
- series parallel
- structural pattern recognition
- graph model
- graph search
- dynamic graph
- connected dominating set
- graph kernels
- finding the shortest path
- connected graphs
- reachability queries
- planar graphs
- maximum cardinality
- graph embedding
- graph edit distance
- graph isomorphism
- disk resident
- small world
- inexact graph matching
- spectral decomposition
- maximum clique
- query graph
- graph patterns
- minimum spanning tree
- evolving graphs
- graph representations
- maximum common subgraph
- structured data
- massive graphs
- association graph
- neighborhood graph
- real world graphs
- dominating set
- adjacency graph
- graph drawing
- directed acyclic graph
- edge weights
- proximity graph
- attributed graphs
- connected components
- strongly connected
- topological information
- web graph
- graph layout
- polynomial time complexity
- average degree
- bounded treewidth
- maximal cliques