Vertex-Flames in Countable Rooted Digraphs Preserving an Erdős-Menger Separation for Each Vertex.

Published in: Comb. (2019)

Keyphrases

directed graph
undirected graph
databases
minimum weight
hamiltonian cycle
data sets
random walk
digital libraries
artificial neural networks
attributed graphs