Asymptotic bounds for clustering problems in random graphs

Article Properties
  • Language
    English
  • DOI (url)
    10.1002/net.22203
  • Publication Date
    2023/12/13
  • Journal
    Networks
  • Indian UGC (journal)
  • Refrences
    40
  • Eugene Lykhovyd Wm. Michael Barnes'64 Department of Industrial and Systems Engineering Texas A&M University College Station Texas USA
  • Sergiy Butenko Wm. Michael Barnes'64 Department of Industrial and Systems Engineering Texas A&M University College Station Texas USA ORCID (unauthenticated)
  • Pavlo Krokhmal Department of Systems and Industrial Engineering University of Arizona Tucson Arizona USA
Abstract
Cite
Lykhovyd, Eugene, et al. “Asymptotic Bounds for Clustering Problems in Random Graphs”. Networks, vol. 83, no. 3, 2023, pp. 485-02, https://doi.org/10.1002/net.22203.
Lykhovyd, E., Butenko, S., & Krokhmal, P. (2023). Asymptotic bounds for clustering problems in random graphs. Networks, 83(3), 485-502. https://doi.org/10.1002/net.22203
Lykhovyd, Eugene, Sergiy Butenko, and Pavlo Krokhmal. “Asymptotic Bounds for Clustering Problems in Random Graphs”. Networks 83, no. 3 (2023): 485-502. https://doi.org/10.1002/net.22203.
Lykhovyd E, Butenko S, Krokhmal P. Asymptotic bounds for clustering problems in random graphs. Networks. 2023;83(3):485-502.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Engineering (General)
Civil engineering (General)
Technology
Manufactures
Production management
Operations management
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
Improved bounds on bell numbers and on moments of sums of random variables 2010
Small Ramsey numbers 2004
On the evolution of random graphs 1960
A combinatorial problem in geometry 1935
Random graphs 1998