Login / Signup
How heavy independent sets help to find arborescences with many leaves in DAGs.
Cristina G. Fernandes
Carla Negri Lintzmayer
Published in:
CoRR (2021)
Keyphrases
</>
directed acyclic graph
social networks
information technology
definite clause
data sets
data mining
computer vision
face recognition
lower bound
pairwise
user interface
state space
set theoretic