Counting Minimum Weight Arborescences

Hayashi, K; Iwata, S

Hayashi, K (reprint author), Univ Tokyo, Dept Math Informat, Tokyo 1138656, Japan.

ALGORITHMICA, 2018; 80 (12): 3908

Abstract

In a directed graph D = (V, A) with a specified vertex r is an element of V, an arc subset B subset of A is called an r -arborescence if B has no arc ......

Full Text Link