Cubic vertex-transitive graphs on up to 1280 vertices.
Primoz PotocnikPablo SpigaGabriel VerretPublished in: J. Symb. Comput. (2013)
Keyphrases
- undirected graph
- labeled graphs
- attributed graphs
- hamiltonian cycle
- connected subgraphs
- edge weights
- maximum cardinality
- vertex set
- weighted graph
- average degree
- directed graph
- minimum weight
- bipartite graph
- graph matching
- adjacency matrix
- random graphs
- spanning tree
- similarity function
- directed acyclic graph
- approximation algorithms
- betweenness centrality
- connected components
- complex networks
- graph coloring
- traveling salesman problem
- transitive closure
- minimum cost
- shortest path
- small world networks
- maximal cliques
- minimum spanning tree
- biological networks
- graph kernels
- phase transition
- graph representation
- triangle mesh
- frequent subgraphs
- neural network
- graph databases
- graph model
- regular expressions
- graph structure
- b spline
- random walk