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.
APA4ort.xyz Knowledge Graph. (2026). A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-new-algorithm-for-finding-minimum-spanning-trees-with-undirected-neutrosophic-graphs
MLA“A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-new-algorithm-for-finding-minimum-spanning-trees-with-undirected-neutrosophic-graphs.
BibTeX@misc{4ortxyz_a-new-algorithm-for-finding-minimum-spanning-trees-with-undirected-neutrosophic-graphs_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs}}, year = {2026}, url = {https://4ort.xyz/entity/a-new-algorithm-for-finding-minimum-spanning-trees-with-undirected-neutrosophic-graphs}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs — https://4ort.xyz/entity/a-new-algorithm-for-finding-minimum-spanning-trees-with-undirected-neutrosophic-graphs (retrieved 2026-05-24)
