Finding and counting patterns in sparse graphs

Show simple item record

dc.contributor.author Komarath, Balagopal
dc.contributor.author Kumar, Anant
dc.contributor.author Mishra, Suchismita
dc.contributor.author Sethia, Aditi
dc.contributor.other 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
dc.coverage.spatial Hamburg, DE
dc.date.accessioned 2023-03-31T13:48:20Z
dc.date.available 2023-03-31T13:48:20Z
dc.date.issued 2023-03-07
dc.identifier.citation Komarath, Balagopal; Kumar, Anant; Mishra, Suchismita and Sethia, Aditi, "Finding and counting patterns in sparse graphs", in the 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), Hamburg, DE, Mar. 7-9, 2023.
dc.identifier.uri https://repository.iitgn.ac.in/handle/123456789/8712
dc.description.statementofresponsibility by Balagopal Komarath, Anant Kumar, Suchismita Mishra and Aditi Sethia
dc.language.iso en_US
dc.title Finding and counting patterns in sparse graphs
dc.type Conference Paper


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