An efficient updation approach for enumerating maximal (?, ?)-cliques of a temporal network

Show simple item record

dc.contributor.author Banerjee, Suman
dc.contributor.author Pal, Bithika
dc.date.accessioned 2020-07-25T16:20:36Z
dc.date.available 2020-07-25T16:20:36Z
dc.date.issued 2020-07
dc.identifier.citation Banerjee, Suman and Pal, Bithika, "An efficient updation approach for enumerating maximal (?, ?)-cliques of a temporal network", arXiv, Cornell University Library, DOI: arXiv:/2007.04411, Jul. 2020. en_US
dc.identifier.uri http://arxiv.org/abs/2007.04411
dc.identifier.uri https://repository.iitgn.ac.in/handle/123456789/5573
dc.description.statementofresponsibility by Suman Banerjee and Bithika Pal
dc.language.iso en_US en_US
dc.publisher Cornell University Library en_US
dc.title An efficient updation approach for enumerating maximal (?, ?)-cliques of a temporal network en_US
dc.type Pre-Print en_US
dc.relation.journal arXiv


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Digital Repository


Browse

My Account