Finding and counting small induced subgraphs efficiently
From MaRDI portal
Publication:6122207
DOI10.1007/3-540-60618-1_62OpenAlexW1545226987MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
This page was built for publication: Finding and counting small induced subgraphs efficiently