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). Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs. Retrieved May 24, 2026, from https://4ort.xyz/entity/fully-polynomial-fpt-algorithms-for-some-classes-of-bounded-clique-width-graphs
MLA“Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/fully-polynomial-fpt-algorithms-for-some-classes-of-bounded-clique-width-graphs.
BibTeX@misc{4ortxyz_fully-polynomial-fpt-algorithms-for-some-classes-of-bounded-clique-width-graphs_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs}}, year = {2026}, url = {https://4ort.xyz/entity/fully-polynomial-fpt-algorithms-for-some-classes-of-bounded-clique-width-graphs}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs — https://4ort.xyz/entity/fully-polynomial-fpt-algorithms-for-some-classes-of-bounded-clique-width-graphs (retrieved 2026-05-24)
