Home › Entities › academia › Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings

Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings

Research article (PolyPublie (École Polytechnique de Montréal), 2020) · cited 18× · AI/ML
academia openalex:W3100911650
Press Enter · cited answer in seconds

Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings

Summary

Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings is a scholarly article[1].

Key Facts

  • Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings's instance of is recorded as scholarly article[2].

Related Entities

Petra Mutzel

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). Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings. Retrieved May 24, 2026, from https://4ort.xyz/entity/weisfeiler-and-leman-go-sparse-towards-scalable-higher-order-graph-embeddings
MLA “Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/weisfeiler-and-leman-go-sparse-towards-scalable-higher-order-graph-embeddings.
BibTeX @misc{4ortxyz_weisfeiler-and-leman-go-sparse-towards-scalable-higher-order-graph-embeddings_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings}}, year = {2026}, url = {https://4ort.xyz/entity/weisfeiler-and-leman-go-sparse-towards-scalable-higher-order-graph-embeddings}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings — https://4ort.xyz/entity/weisfeiler-and-leman-go-sparse-towards-scalable-higher-order-graph-embeddings (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/weisfeiler-and-leman-go-sparse-towards-scalable-higher-order-graph-embeddings · Last refreshed: