Packing smaller graphs into a graph.
Jin AkiyamaFumi NakadaSinichi TokunagaPublished in: Discret. Math. (1989)
Keyphrases
- graph representation
- graph theory
- graph matching
- graph structure
- directed graph
- labeled graphs
- graph construction
- graph model
- weighted graph
- adjacency matrix
- graph databases
- graph mining
- graph data
- graph structures
- graph theoretic
- series parallel
- graph classification
- graph theoretical
- graph clustering
- graph properties
- graph search
- subgraph isomorphism
- graph partitioning
- random graphs
- spanning tree
- graph edit distance
- undirected graph
- graph kernels
- connected graphs
- graph transformation
- graph isomorphism
- reachability queries
- dynamic graph
- structural pattern recognition
- bipartite graph
- disk resident
- maximal cliques
- minimum spanning tree
- planar graphs
- real world graphs
- web graph
- graph drawing
- connected dominating set
- dense subgraphs
- maximum common subgraph
- query graph
- maximum clique
- directed acyclic
- packing problem
- small world
- neighborhood graph
- graph embedding
- social graphs
- bounded treewidth
- attributed graphs
- adjacency graph
- association graph
- polynomial time complexity
- fully connected
- strongly connected
- edge weights
- graph layout
- evolving graphs
- structured data
- complex networks
- inexact graph matching
- random walk
- directed acyclic graph
- average degree