Critical Vertices and Edges in $H$-free Graphs.
Daniël PaulusmaChristophe PicouleauBernard RiesPublished in: CoRR (2017)
Keyphrases
- weighted graph
- undirected graph
- directed edges
- edge weights
- directed graph
- spanning tree
- vertex set
- adjacency matrix
- random graphs
- graph structure
- minimum weight
- densely connected
- labeled graphs
- attributed graphs
- directed acyclic graph
- real world graphs
- graph model
- graph clustering
- connected subgraphs
- graph partitioning
- bipartite graph
- approximation algorithms
- graph matching
- connected components
- shortest path
- spectral embedding
- minimum cost
- graph mining
- maximal cliques
- average degree
- massive graphs
- complex networks
- graph theoretic
- minimum spanning tree
- connected graphs
- pairwise
- data objects
- social network analysis
- social networks