ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1705.04119
  4. Cited By
Memetic search for identifying critical nodes in sparse graphs
v1v2 (latest)

Memetic search for identifying critical nodes in sparse graphs

11 May 2017
Yangming Zhou
Jin-Kao Hao
F. Glover
ArXiv (abs)PDFHTML

Papers citing "Memetic search for identifying critical nodes in sparse graphs"

4 / 4 papers shown
Title
Heuristic Search for Rank Aggregation with Application to Label Ranking
Heuristic Search for Rank Aggregation with Application to Label Ranking
Yangming Zhou
Jin-Kao Hao
Zhen Li
F. Glover
28
3
0
11 Jan 2022
A threshold search based memetic algorithm for the disjunctively
  constrained knapsack problem
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
Zequn Wei
Jin‐Kao Hao
22
8
0
12 Jan 2021
Variable Population Memetic Search: A Case Study on the Critical Node
  Problem
Variable Population Memetic Search: A Case Study on the Critical Node Problem
Yangming Zhou
Jin-Kao Hao
Zhang-Hua Fu
Zhe Wang
Xiangjing Lai
31
33
0
12 Sep 2019
An Incremental Evaluation Mechanism for the Critical Node Problem
Biqing Fang
Hai Wan
Shaowei Cai
Zejie Cai
23
0
0
11 Jun 2019
1