Login / Signup
Generating connected acyclic digraphs uniformly at random
Guy Melançon
Fabrice Philippe
Published in:
CoRR (2004)
Keyphrases
</>
np hard
connected graphs
connected components
real world
directed graph
equivalence classes
computational complexity
np complete
social networks
computer vision
information systems
lower bound
markov chain
binary images