Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs

Uproszczony widok
dc.affiliationUniwersytet Warszawski
dc.conference.countryDania
dc.conference.datefinish2019-08-14
dc.conference.datestart2019-08-11
dc.conference.placeCopenhagen
dc.conference.seriesInternational Symposium on Fundamentals of Computer Theory
dc.conference.seriesInternational Symposium on Fundamentals of Computer Theory
dc.conference.shortcutFCT 2019
dc.conference.weblinkhttps://di.ku.dk/fct2019/
dc.contributor.authorKowaluk, Mirosław
dc.contributor.authorLingas, Andrzej
dc.date.accessioned2024-01-25T18:46:44Z
dc.date.available2024-01-25T18:46:44Z
dc.date.issued2019
dc.description.financeNie dotyczy
dc.description.volumeLNCS 11651
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/117876
dc.identifier.weblinkhttps://link.springer.com/chapter/10.1007%2F978-3-030-25027-0_22
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.pages322-334
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.titleRare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
dc.typeJournalArticle
dspace.entity.typePublication