On bounded automorphisms of locally finite transitive graphs.
Peter NiemeyerPublished in: J. Graph Theory (1996)
Keyphrases
- bounded degree
- directed graph
- transitive closure
- graph theoretic
- case study
- bounded treewidth
- graph matching
- weighted graph
- unit length
- subgraph isomorphism
- finite automata
- graph partitioning
- finite number
- graph theory
- query evaluation
- graph model
- small world
- graph clustering
- graph structures
- social network analysis
- search algorithm
- series parallel
- bayesian networks
- data sets