Home › Entities › academia › Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings

Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings

Research article (Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021) · cited 24× · AI/ML
academia openalex:W3183584936
Press Enter · cited answer in seconds

Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings

Summary

Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings is a scholarly article[1].

Key Facts

  • Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings's instance of is recorded as scholarly article[2].

Related Entities

Chandan K. Reddy

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). Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings. Retrieved May 24, 2026, from https://4ort.xyz/entity/interpretable-graph-similarity-computation-via-differentiable-optimal-alignment-of-node-embeddings
MLA “Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/interpretable-graph-similarity-computation-via-differentiable-optimal-alignment-of-node-embeddings.
BibTeX @misc{4ortxyz_interpretable-graph-similarity-computation-via-differentiable-optimal-alignment-of-node-embeddings_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings}}, year = {2026}, url = {https://4ort.xyz/entity/interpretable-graph-similarity-computation-via-differentiable-optimal-alignment-of-node-embeddings}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings — https://4ort.xyz/entity/interpretable-graph-similarity-computation-via-differentiable-optimal-alignment-of-node-embeddings (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/interpretable-graph-similarity-computation-via-differentiable-optimal-alignment-of-node-embeddings · Last refreshed: