Feynman graph generation and calculations in the Hopf algebra of Feynman graphs.
Michael BorinskyPublished in: Comput. Phys. Commun. (2014)
Keyphrases
- graph structure
- graph representation
- graph theory
- weighted graph
- directed graph
- graph mining
- graph databases
- graph matching
- graph construction
- graph theoretic
- adjacency matrix
- labeled graphs
- graph model
- graph properties
- graph search
- graph classification
- graph structures
- subgraph isomorphism
- series parallel
- random graphs
- bipartite graph
- graph theoretical
- graph data
- graph clustering
- graph partitioning
- undirected graph
- graph isomorphism
- graph kernels
- spanning tree
- reachability queries
- directed acyclic
- minimum spanning tree
- structural pattern recognition
- random walk
- frequent subgraphs
- dynamic graph
- graph drawing
- attributed graphs
- structured data
- web graph
- hyper graph
- adjacency graph
- disk resident
- maximum common subgraph
- dense subgraphs
- evolving graphs
- graph representations
- community discovery
- edge weights
- neighborhood graph
- query language
- attributed relational graph
- inexact graph matching
- maximum cardinality
- massive graphs
- directed acyclic graph
- graph patterns
- graph embedding
- average degree
- social graphs
- real world graphs
- planar graphs
- small world
- graph layout
- algebraic structures
- maximal cliques
- connected components
- maximum clique