Unique small subgraphs are not easier to find

DOI10.1007/978-3-642-21254-3_26zbMATH Open1330.68224OpenAlexW2258034528MaRDI QIDQ3004591FDOQ3004591

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

Publication date: 3 June 2011

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

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

Recommendations

• Unique subgraphs are not easier to find
• Are unique subgraphs not easier to find?
• Induced subgraph isomorphism: are some patterns substantially easier than others?
• Induced subgraph isomorphism: are some patterns substantially easier than others?
• Detecting and counting small pattern graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Unique small subgraphs are not easier to find

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