Home › Entities › academia › Balance between complexity and quality: local search for minimum vertex cover in massive graphs

Balance between complexity and quality: local search for minimum vertex cover in massive graphs

Research article (International Conference on Artificial Intelligence, 2015) · cited 89× · AI/ML
academia openalex:W2251648435
Press Enter · cited answer in seconds

Balance between complexity and quality: local search for minimum vertex cover in massive graphs

Summary

Balance between complexity and quality: local search for minimum vertex cover in massive graphs is a scholarly article[1].

Key Facts

  • Balance between complexity and quality: local search for minimum vertex cover in massive graphs's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 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). Balance between complexity and quality: local search for minimum vertex cover in massive graphs. Retrieved May 24, 2026, from https://4ort.xyz/entity/balance-between-complexity-and-quality-local-search-for-minimum-vertex-cover-in-massive-graphs
MLA “Balance between complexity and quality: local search for minimum vertex cover in massive graphs.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/balance-between-complexity-and-quality-local-search-for-minimum-vertex-cover-in-massive-graphs.
BibTeX @misc{4ortxyz_balance-between-complexity-and-quality-local-search-for-minimum-vertex-cover-in-massive-graphs_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Balance between complexity and quality: local search for minimum vertex cover in massive graphs}}, year = {2026}, url = {https://4ort.xyz/entity/balance-between-complexity-and-quality-local-search-for-minimum-vertex-cover-in-massive-graphs}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Balance between complexity and quality: local search for minimum vertex cover in massive graphs — https://4ort.xyz/entity/balance-between-complexity-and-quality-local-search-for-minimum-vertex-cover-in-massive-graphs (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/balance-between-complexity-and-quality-local-search-for-minimum-vertex-cover-in-massive-graphs · Last refreshed: