Finding and counting small induced subgraphs efficiently

DOI10.1007/3-540-60618-1_62MaRDI QIDQ6122207

Dieter Kratsch, Ton Kloks, Haiko Müller

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60618-1_62

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)