Butterfly counting and bitruss decomposition on uncertain bipartite graphs

HIGHLIGHTS

  • who: Alexander Zhou from the Hong Kong University of Science and Technology, Hong Kong, China have published the paper: Butterfly counting and bitruss decomposition on uncertain bipartite graphs, in the Journal: (JOURNAL)
  • what: In this the authors examine the uncertain butterfly structure (in which the existential probability of the graphlet is greater than or equal to a threshold parameter) as well as the global Uncertain Butterfly Counting Problem (to count the total number of these instances over an entire network). To solve this task the authors propose a non-trivial exact baseline (U B FC . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?