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

A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques

Uproszczony widok
dc.affiliationUniwersytet Warszawski
dc.conference.countryTajwan
dc.conference.datefinish2017-05-31
dc.conference.datestart2017-05-29
dc.conference.placeHsinchu
dc.conference.seriesInternational Workshop on Algorithms and Computation
dc.conference.seriesInternational Workshop on Algorithms and Computation
dc.conference.shortcutWALCOM 2017
dc.conference.weblinkhttps://walcom2017.nctu.edu.tw/
dc.contributor.authorKowaluk, Mirosław
dc.contributor.authorLingas, Andrzej
dc.date.accessioned2024-01-24T17:35:20Z
dc.date.available2024-01-24T17:35:20Z
dc.date.issued2017
dc.description.financeNie dotyczy
dc.description.volume10167
dc.identifier.doi10.1007/978-3-319-53925-6_17
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/101539
dc.identifier.weblinkhttps://link.springer.com/chapter/10.1007%2F978-3-319-53925-6_17
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.pages217-227
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.subject.enInduced subgraph isomorphism
dc.subject.enMatrix multiplication
dc.subject.enWitnesses for Boolean matrix product
dc.subject.enTime complexity
dc.titleA Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques
dc.typeJournalArticle
dspace.entity.typePublication