On Fault-Tolerant Low-Diameter Clusters in Graphs
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2022/11/01
-
Journal
-
Indian UGC (journal)
-
Refrences61
-
Citations1
-
Yajun Lu Department of Management & Marketing, Jacksonville State University, Jacksonville, Alabama 36265; ORCID (unauthenticated)
-
Hosseinali Salemi Department of Industrial & Manufacturing Systems Engineering, Iowa State University, Ames, Iowa 50011;
-
Balabhaskar Balasundaram School of Industrial Engineering & Management, Oklahoma State University, Stillwater, Oklahoma 74078 ORCID (unauthenticated)
-
Austin Buchanan School of Industrial Engineering & Management, Oklahoma State University, Stillwater, Oklahoma 74078 ORCID (unauthenticated)
Abstract
Cite
Lu, Yajun, et al. “On Fault-Tolerant Low-Diameter Clusters in Graphs”. INFORMS Journal on Computing, vol. 34, no. 6, 2022, pp. 3181-99, https://doi.org/10.1287/ijoc.2022.1231.
Lu, Y., Salemi, H., Balasundaram, B., & Buchanan, A. (2022). On Fault-Tolerant Low-Diameter Clusters in Graphs. INFORMS Journal on Computing, 34(6), 3181-3199. https://doi.org/10.1287/ijoc.2022.1231
Lu, Yajun, Hosseinali Salemi, Balabhaskar Balasundaram, and Austin Buchanan. “On Fault-Tolerant Low-Diameter Clusters in Graphs”. INFORMS Journal on Computing 34, no. 6 (2022): 3181-99. https://doi.org/10.1287/ijoc.2022.1231.
Lu Y, Salemi H, Balasundaram B, Buchanan A. On Fault-Tolerant Low-Diameter Clusters in Graphs. INFORMS Journal on Computing. 2022;34(6):3181-99.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Manufactures
Production management
Operations management
You May Also Like
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- A probabilistic heuristic for a computationally difficult set covering problem
- The carbon-constrained EOQ
- Future paths for integer programming and links to artificial intelligence
- A general heuristic for vehicle routing problems
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Title | 1927 | |||
| Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing | 2005 | |||
| Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing | 1964 | |||
| Introduction to Graph Theory | 2001 | |||
| Combinatorial Optimization: Networks and Matroids | 1976 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube | Discrete Applied Mathematics |
| 1 | 2023 |
Citations Analysis
The category
Science: Mathematics 1
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube and was published in 2023. The most recent citation comes from a 2023 study titled Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube. This article reached its peak citation in 2023, with 1 citations. It has been cited in 1 different journals. Among related journals, the Discrete Applied Mathematics cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.