Recurrence relations for graph polynomials on bi-iterative families of graphs.
Tomer KotekJohann A. MakowskyPublished in: Eur. J. Comb. (2014)
Keyphrases
- graph structures
- graph structure
- graph representation
- graph theory
- directed graph
- weighted graph
- graph matching
- labeled graphs
- graph mining
- social graphs
- adjacency matrix
- graph construction
- graph databases
- graph model
- graph clustering
- graph theoretic
- graph theoretical
- graph properties
- graph classification
- series parallel
- subgraph isomorphism
- graph transformation
- undirected graph
- graph kernels
- spanning tree
- graph data
- graph search
- random graphs
- bipartite graph
- topological information
- graph partitioning
- real world graphs
- structural pattern recognition
- graph representations
- business intelligence
- random walk
- connected dominating set
- graph layout
- relational structures
- structured data
- connected components
- edge weights
- dependency graph
- connected graphs
- evolving graphs
- reachability queries
- minimum spanning tree
- graph patterns
- attributed graphs
- maximum common subgraph
- dense subgraphs
- graph isomorphism
- spectral decomposition
- dynamic graph
- polynomial time complexity
- maximum cardinality
- bounded treewidth
- directed acyclic
- maximal cliques
- inexact graph matching
- planar graphs
- neighborhood graph
- web graph
- adjacency graph
- strongly connected
- query graph
- vertex set
- maximum independent set
- finding the shortest path
- social networks
- massive graphs
- graphical models
- shortest path
- frequent subgraphs
- graph drawing
- small world
- association graph