Mysteries Department
Sign inRequest access
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.

MYS08HTEHX052AX · mystery · click to copyMVoynich ManuscriptThesisChecked 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

SRC

Cite it

Ganassali, L. (2022). The graph alignment problem: fundamental limits and efficient algorithms. PhD thesis. https://arxiv.org/abs/2404.12418
Private beta Downloads are for beta members

We're in a private beta while we get things right. Everything here is free to read; downloading datasets, sources and code is open to members for now.

It takes a couple of minutes. We'll reply by email.