most citedComplexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops

6 citations · 15 across the 6 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2008★ 2 cited

On Complexity of Minimum Leaf Out-branching Problem

Peter Dankelmann, Gregory Gutin, Eun Jung Kim

Given a digraph , the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in an out-branching with the minimum possible number of leaves, i.e., vertices of…

cs.DS2008

Minimum Leaf Out-branching and Related Problems

G. Gutin, I. Razgon, E. J. Kim

Given a digraph , the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in an out-branching with the minimum possible number of leaves, i.e., vertices of…