Exact combinatorial algorithms and experiments for finding maximum k-plexes
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2011/03/09
-
Indian UGC (journal)
-
Refrences40
-
Citations20
-
Hannes Moser
-
Rolf Niedermeier
-
Manuel Sorge
Cite
Moser, Hannes, et al. “Exact Combinatorial Algorithms and Experiments for finding Maximum K-Plexes”. Journal of Combinatorial Optimization, vol. 24, no. 3, 2011, pp. 347-73, https://doi.org/10.1007/s10878-011-9391-5.
Moser, H., Niedermeier, R., & Sorge, M. (2011). Exact combinatorial algorithms and experiments for finding maximum k-plexes. Journal of Combinatorial Optimization, 24(3), 347-373. https://doi.org/10.1007/s10878-011-9391-5
Moser, Hannes, Rolf Niedermeier, and Manuel Sorge. “Exact Combinatorial Algorithms and Experiments for finding Maximum K-Plexes”. Journal of Combinatorial Optimization 24, no. 3 (2011): 347-73. https://doi.org/10.1007/s10878-011-9391-5.
Moser H, Niedermeier R, Sorge M. Exact combinatorial algorithms and experiments for finding maximum k-plexes. Journal of Combinatorial Optimization. 2011;24(3):347-73.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
- An algorithmic framework for convex mixed integer nonlinear programs
- Bike sharing systems: Solving the static rebalancing problem
- Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
- An algorithm for drawing general undirected graphs
- An efficient algorith for determining the convex hull of a finite planar set
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing | SIAM Journal on Discrete Mathematics |
| 20 | 2010 |
| Isolation concepts for efficiently enumerating dense subgraphs | Theoretical Computer Science |
| 26 | 2009 |
| Isolation concepts for clique enumeration: Comparison and computational experiments | Theoretical Computer Science |
| 8 | 2009 |
| Techniques for Practical Fixed-Parameter Algorithms | The Computer Journal |
| 16 | 2008 |
| Crown Structures for Vertex Cover Kernelization | Theory of Computing Systems |
| 39 | 2007 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Maximum k-Plex Computation: Theory and Practice | Proceedings of the ACM on Management of Data | 2024 | ||
| Reinforcement learning based coarse-to-fine search for the maximum k-plex problem | Applied Soft Computing |
| 1 | 2022 |
Efficient maximum
k
-plex computation over large sparse graphs | Proceedings of the VLDB Endowment |
| 2 | 2022 |
| Hardness and tractability of the γ-Complete Subgraph problem | Information Processing Letters |
| 1 | 2021 |
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem | Algorithmica |
| 9 | 2020 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 11
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled On Bounded-Degree Vertex Deletion parameterized by treewidth and was published in 2012. The most recent citation comes from a 2024 study titled Maximum k-Plex Computation: Theory and Practice. This article reached its peak citation in 2019, with 4 citations. It has been cited in 19 different journals, 10% of which are open access. Among related journals, the Discrete Applied Mathematics cited this research the most, with 2 citations. The chart below illustrates the annual citation trends for this article.