Rare siblings speed-up deterministic detection and counting of small pattern graphs

DOI10.1007/978-3-030-25027-0_22MaRDI QIDQ5919359zbMATH OpenOpenAlexFDO

Authors Mirosław Kowaluk, Andrzej Lingas

Publication date 30 January 2020

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-25027-0_22

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Rare siblings speed-up deterministic detection and counting of small pattern graphs
• A fast deterministic detection of small pattern graphs in graphs without large cliques
• A fast deterministic detection of small pattern graphs in graphs without large cliques
• Detecting and counting small pattern graphs
• Detecting and Counting Small Pattern Graphs

Cited in

(2)

• Detecting and Counting Small Pattern Graphs
• Rare siblings speed-up deterministic detection and counting of small pattern graphs

This page was built for publication: Rare siblings speed-up deterministic detection and counting of small pattern graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919359)