Sign in

Generating connected acyclic digraphs uniformly at random.

Guy MelançonFabrice Philippe
Published in: Inf. Process. Lett. (2004)
Keyphrases
  • np hard
  • np complete
  • directed graph
  • probabilistic model
  • information systems
  • database systems
  • random walk
  • equivalence classes
  • automatically generating
  • connected graphs