Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture.
Guillaume ChapuyGuillem PerarnauPublished in: SODA (2016)
Keyphrases
- connected components
- graph connectivity
- graph structure
- equivalence classes
- graph theory
- binary images
- graph theoretic
- bounded degree
- directed acyclic graph
- strongly connected
- directed graph
- bipartite graph
- random walk
- neural network
- graph databases
- topological information
- graph mining
- minimum spanning tree
- graph representation
- graph model
- class labels
- genetic algorithm