Symmetrical path-cycle covers of a graph and polygonal graphs.
Cai Heng LiÁkos SeressPublished in: J. Comb. Theory, Ser. A (2007)
Keyphrases
- graph representation
- weighted graph
- graph structure
- graph theory
- graph matching
- finding the shortest path
- graph databases
- edge weights
- labeled graphs
- graph construction
- directed graph
- shortest path
- graph model
- graph mining
- adjacency matrix
- graph clustering
- graph theoretic
- graph search
- graph classification
- graph structures
- graph partitioning
- bipartite graph
- graph properties
- random graphs
- subgraph isomorphism
- graph theoretical
- graph isomorphism
- series parallel
- structural pattern recognition
- graph representations
- graph data
- dynamic graph
- strongly connected
- maximum common subgraph
- inexact graph matching
- solution path
- maximum clique
- spanning tree
- adjacency graph
- path length
- undirected graph
- hyper graph
- graph transformation
- disk resident
- neighborhood graph
- graph kernels
- minimum spanning tree
- evolving graphs
- small world
- dense subgraphs
- directed acyclic
- maximum cardinality
- reachability queries
- maximum independent set
- graph layout
- proximity graph
- connected dominating set
- average degree
- social graphs
- polynomial time complexity
- bounded treewidth
- maximal cliques
- frequent subgraphs
- web graph
- structured data
- connected components
- community detection
- minimum cost
- connected graphs
- shortest path problem
- graph patterns
- massive graphs
- minimum length
- real world graphs