Heuristics for the min–max arc crossing problem in graphs
Research article (Expert Systems with Applications, 2018) · cited 12× · AI/ML
Press Enter · cited answer in seconds
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Direct Wikidata claims
- [2] ↑ Heuristics for the min–max arc crossing problem in graphs — instance of (P31): scholarly article. wikidata.org.
Class ancestry
📑 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). Heuristics for the min–max arc crossing problem in graphs. Retrieved May 24, 2026, from https://4ort.xyz/entity/heuristics-for-the-minmax-arc-crossing-problem-in-graphs
MLA
“Heuristics for the min–max arc crossing problem in graphs.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/heuristics-for-the-minmax-arc-crossing-problem-in-graphs.
BibTeX
@misc{4ortxyz_heuristics-for-the-minmax-arc-crossing-problem-in-graphs_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Heuristics for the min–max arc crossing problem in graphs}}, year = {2026}, url = {https://4ort.xyz/entity/heuristics-for-the-minmax-arc-crossing-problem-in-graphs}, note = {Accessed: 2026-05-24}}
LLM prompt
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Heuristics for the min–max arc crossing problem in graphs — https://4ort.xyz/entity/heuristics-for-the-minmax-arc-crossing-problem-in-graphs (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/heuristics-for-the-minmax-arc-crossing-problem-in-graphs · Last refreshed: