Detecting and Counting Small Pattern Graphs

DOI10.1007/978-3-642-45030-3_51zbMath1406.68128OpenAlexW2240510185MaRDI QIDQ2872118

Eva-Marta Lundell, Mirosław Kowaluk, Peter Floderus, Andrzej Lingas

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_51

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Randomized algorithms (68W20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Induced subgraph isomorphism: are some patterns substantially easier than others? ⋮ Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles

This page was built for publication: Detecting and Counting Small Pattern Graphs