Maximum k-Plex Computation: Theory and Practice
Abstract
References
Index Terms
- Maximum k-Plex Computation: Theory and Practice
Recommendations
Efficient maximum k-plex computation over large sparse graphs
The k-plex model is a relaxation of the clique model by allowing every vertex to miss up to k neighbors. Designing exact and efficient algorithms for computing a maximum k-plex in a graph has been receiving increasing interest recently. However, the ...
Combinatorial algorithms for the maximum k-plex problem
The maximum clique problem provides a classic framework for detecting cohesive subgraphs. However, this approach can fail to detect much of the cohesive structure in a graph. To address this issue, Seidman and Foster introduced k-plexes as a degree-...
k-Wiener index of a k-plex
AbstractA k-plex is a hypergraph with the property that each subset of a hyperedge is also a hyperedge and each hyperedge contains at most vertices. We introduce a new concept called the k-Wiener index of a k-plex as the summation of k-distances ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 626Total Downloads
- Downloads (Last 12 months)626
- Downloads (Last 6 weeks)103
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