# Ganassali 2022: The graph alignment problem: fundamental limits and efficient algorithms

> Luca Ganassali, 2022. 1 records on Mysteries Department cite it. The emerging-methods survey cites it for aligning the manuscript's word network with a…

Source: https://mysteriesdept.com/sources/SRC0D8MQZ4T1S59/the-graph-alignment-problem-fundamental-limits-and-efficient  
Publisher: Mysteries Department  
Licence: CC BY 4.0 (credit Mysteries Department and link the page)  

---

[Sources](https://mysteriesdept.com/sources)[Voynich Manuscript](https://mysteriesdept.com/mysteries/voynich-manuscript)Ganassali 2022

**0**

# The graph alignment problem: fundamental limits and efficient algorithms

Luca Ganassali, 2022. _PhD thesis_.

A doctoral thesis on graph alignment: when two networks can be matched node to node, and the algorithms that do it.

**Voynich Manuscript** ThesisChecked against the original0

## What it's used for here

The emerging-methods survey cites it for aligning the manuscript's word network with a reference language's.

## Cited by on this site 1 record

[1 methods surveys]

Mathematics

SRC

## Cite it

```
Ganassali, L. (2022). The graph alignment problem: fundamental limits and efficient algorithms. PhD thesis. https://arxiv.org/abs/2404.12418
```

[Read it free at arxiv.org](https://arxiv.org/abs/2404.12418)

Key

**SRC** 0D8MQZ4T1S59

Kind

Thesis

Rights

arXiv-nonexclusive

Checked

Against the published original

Added by

[apollo](https://mysteriesdept.com/u/apollo)

The record

Bibliographic records are CC0. Take this one as CSL-JSON, BibTeX or RIS.

[CSL-JSON](https://mysteriesdept.com/sources/SRC0D8MQZ4T1S59/the-graph-alignment-problem-fundamental-limits-and-efficient/csl.json)