Reconstructing undirected graphs from eigenspaces.

Yohann de Castro Thibault Espinasse Paul Rochet

Published in: CoRR (2016)

Keyphrases

undirected graph
approximation algorithms
directed graph
complex networks
minimum cost
directed acyclic graph
spanning tree
connected components
positive integer
graph structure
markov models
disjoint paths
random graphs
multicommodity flow
strongly connected
vertex set
bayesian networks