Edge-partitioning graphs into regular and locally irregular components.
Julien BensmailBrett StevensPublished in: Discret. Math. Theor. Comput. Sci. (2016)
Keyphrases
- weighted graph
- vertex set
- graph partitioning
- undirected graph
- minimum spanning trees
- adjacency graph
- graph model
- graph databases
- graph representation
- spectral graph
- partitioning algorithm
- graph search
- random graphs
- graph clustering
- graph theoretic
- image segmentation
- community detection
- bipartite graph
- directed graph
- pairwise