Some degree and forbidden subgraph conditions for a graph to have a k-contractible edge.
Kiyoshi AndoPublished in: Discret. Math. (2016)
Keyphrases
- weighted graph
- edge weights
- graph mining
- graph databases
- maximum weight
- graph classification
- labeled graphs
- graph data
- graph properties
- subgraph isomorphism
- undirected graph
- vertex set
- random graphs
- directed graph
- graph representation
- sufficient conditions
- connected subgraphs
- disjoint paths
- graph structure
- subgraph matching
- graph matching
- bipartite graph
- edge detection
- graph theory
- edge information
- maximum matching
- dense subgraphs
- random walk
- graph theoretic
- frequent subgraphs
- structured data
- connected components
- maximum clique
- graph model
- directed acyclic graph
- spanning tree
- frequent subgraph mining
- shortest path
- densely connected
- graph mining algorithms
- multiscale
- stable set
- strongly connected
- graph clustering
- path length
- small world
- graph partitioning
- edge detector
- np hard