Complexity and Geometry of Sampling Connected Graph Partitions.
Lorenzo NajtDaryl R. DeFordJustin SolomonPublished in: CoRR (2019)
Keyphrases
- connected components
- graph theory
- worst case
- clustering algorithm
- neighborhood graph
- graph structure
- directed graph
- image segmentation
- graph model
- binary images
- sample size
- upper bound
- high dimensional
- graph matching
- computational complexity
- graph partitioning
- graph theoretic
- geometric information
- sampling methods
- neural network
- causal graph