k-restricted edge connectivity in (p+1)-clique-free graphs.
Shiying WangLei ZhangShangwei LinPublished in: Discret. Appl. Math. (2015)
Keyphrases
- weighted graph
- undirected graph
- strongly connected
- maximum weight
- maximum clique
- directed graph
- independent set
- graph properties
- connected components
- graph connectivity
- quasi cliques
- minimum spanning trees
- disjoint paths
- edge detection
- edge weights
- edge information
- random graphs
- graph kernels
- graph partitioning
- graph clustering
- graph model
- topological information
- graph representation
- vertex set
- subgraph isomorphism
- adjacency graph
- graph theory
- bipartite graph
- approximation algorithms
- edge detector
- topological properties