Graph partition and identification of cluster number in data analysis
Abstract
References
Index Terms
- Graph partition and identification of cluster number in data analysis
Recommendations
Graph partition into paths containing specified vertices
For a graph G, let σ2(G) denote the minimum degree sum of a pair of nonadjacent vertices. Suppose G is a graph of order n. Enomoto and Ota (J. Graph Theory 34 (2000) 163-169) conjectured that, if a partition n = Σi=1k ai is given and σ2(G) Ge; n + k - 1,...
Exact algorithms for dominating induced matching based on graph partition
A dominating induced matching, also called an efficient edge domination, of a graph G = ( V , E ) with n = | V | vertices and m = | E | edges is a subset F E of edges in the graph such that no two edges in F share a common endpoint and each edge in E F ...
Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A Performance Guarantee for Spectral Clustering
AbstractSpectral clustering has become one of the most widely used clustering techniques when the structure of the individual clusters is non-convex or highly anisotropic. Yet, despite its immense popularity, there exists fairly little theory about ...
Comments
Information & Contributors
Information
Published In
- General Chairs:
- Suk-Han Lee,
- Lajos Hanzo,
- Program Chairs:
- Min Young Chung,
- Sang-Won Lee,
- Kwangsu Cho
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 181Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in