Supereulerian graphs and the Petersen Graph, II.
Zhi-Hong ChenHong-Jian LaiPublished in: Ars Comb. (1998)
Keyphrases
- graph representation
- graph structure
- directed graph
- graph theory
- graph construction
- labeled graphs
- graph matching
- weighted graph
- graph mining
- adjacency matrix
- graph clustering
- graph theoretic
- graph classification
- graph structures
- graph databases
- graph partitioning
- subgraph isomorphism
- graph theoretical
- graph search
- graph data
- graph model
- random graphs
- graph kernels
- graph edit distance
- series parallel
- graph properties
- structural pattern recognition
- spanning tree
- bipartite graph
- inexact graph matching
- query graph
- minimum spanning tree
- graph representations
- dynamic graph
- connected graphs
- connected dominating set
- undirected graph
- disk resident
- social graphs
- graph transformation
- graph isomorphism
- evolving graphs
- independent set
- attributed graphs
- maximum independent set
- structured data
- directed acyclic
- reachability queries
- graph drawing
- real world graphs
- graph patterns
- maximum clique
- neighborhood graph
- bounded treewidth
- maximum cardinality
- finding the shortest path
- connected components
- maximum common subgraph
- maximal cliques
- edge weights
- polynomial time complexity
- average degree
- planar graphs
- proximity graph
- dense subgraphs
- graph layout
- adjacency graph
- frequent subgraphs
- random walk
- fully connected
- pattern mining
- association graph
- graph embedding