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). Finding strongly connected components of simple digraphs based on generalized rough sets theory. Retrieved May 24, 2026, from https://4ort.xyz/entity/finding-strongly-connected-components-of-simple-digraphs-based-on-generalized-rough-sets-theory
MLA“Finding strongly connected components of simple digraphs based on generalized rough sets theory.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/finding-strongly-connected-components-of-simple-digraphs-based-on-generalized-rough-sets-theory.
BibTeX@misc{4ortxyz_finding-strongly-connected-components-of-simple-digraphs-based-on-generalized-rough-sets-theory_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Finding strongly connected components of simple digraphs based on generalized rough sets theory}}, year = {2026}, url = {https://4ort.xyz/entity/finding-strongly-connected-components-of-simple-digraphs-based-on-generalized-rough-sets-theory}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Finding strongly connected components of simple digraphs based on generalized rough sets theory — https://4ort.xyz/entity/finding-strongly-connected-components-of-simple-digraphs-based-on-generalized-rough-sets-theory (retrieved 2026-05-24)
