Critical vertices and edges in H-free graphs.
Daniël PaulusmaChristophe PicouleauBernard RiesPublished in: Discret. Appl. Math. (2019)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed edges
- directed graph
- vertex set
- spanning tree
- random graphs
- adjacency matrix
- bipartite graph
- labeled graphs
- densely connected
- shortest path
- graph partitioning
- approximation algorithms
- graph model
- attributed graphs
- maximum matching
- average degree
- maximum cardinality
- graph theoretic
- edge detector
- random walk
- neural network
- complex networks
- connected components
- minimum weight
- graph structure
- hamiltonian cycle
- community detection
- massive graphs
- data objects
- minimum spanning tree
- directed acyclic graph
- maximal cliques
- minimum cost
- graph structures
- graph clustering