Recognizing small subgraphs

DOI10.1002/net.3230250404zbMath0843.90125OpenAlexW2153622112MaRDI QIDQ4861348

Gopalakrishnan Sundaram, Steven S. Skiena

Publication date: 19 August 1996

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230250404

zbMATH Keywords

NP-completesubgraph isomorphism

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

Simulation relations for pattern matching in directed graphs, The challenges of unbounded treewidth in parameterised subgraph counting problems, Finding and counting given length cycles

Cites Work

• Graph minors. XX: Wagner's conjecture
• Unnamed Item
• Unnamed Item