A fast heuristic algorithm for the critical node problem

Research article (Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2017) · cited 12× · AI/ML
Press Enter · cited answer in seconds

A fast heuristic algorithm for the critical node problem

Summary

A fast heuristic algorithm for the critical node problem is a scholarly article[1].

Key Facts

  • A fast heuristic algorithm for the critical node problem's instance of is recorded as scholarly article[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). A fast heuristic algorithm for the critical node problem. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-fast-heuristic-algorithm-for-the-critical-node-problem
MLA “A fast heuristic algorithm for the critical node problem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-fast-heuristic-algorithm-for-the-critical-node-problem.
BibTeX @misc{4ortxyz_a-fast-heuristic-algorithm-for-the-critical-node-problem_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A fast heuristic algorithm for the critical node problem}}, year = {2026}, url = {https://4ort.xyz/entity/a-fast-heuristic-algorithm-for-the-critical-node-problem}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A fast heuristic algorithm for the critical node problem — https://4ort.xyz/entity/a-fast-heuristic-algorithm-for-the-critical-node-problem (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/a-fast-heuristic-algorithm-for-the-critical-node-problem · Last refreshed: