On infinite-finite duality pairs of directed graphs

Péter L. Erdös Claude Tardif Gábor Tardos

Published in: CoRR (2012)

Keyphrases

directed graph
finite sets
random walk
linear programming
directed acyclic graph
real numbers
graph structure
undirected graph
pairwise
finite number
linearly separable
data sets
finite dimensional
maximum flow
finitely representable
candidate pairs
upper bound
genetic algorithm