Login / Signup

Efficient Bubble Enumeration in Directed Graphs.

Etienne BirmeléPierluigi CrescenziRui A. FerreiraRoberto GrossiVincent LacroixAndrea MarinoNadia PisantiGustavo Akio Tominaga SacomotoMarie-France Sagot
Published in: SPIRE (2012)
Keyphrases
  • directed graph
  • random walk
  • data sets
  • computationally efficient
  • real world
  • artificial intelligence
  • data structure
  • special case
  • computationally expensive