Recognizing small subgraphs

DOI10.1002/NET.3230250404MaRDI QIDQ4861348zbMATH OpenOpenAlexFDO

Authors Gopalakrishnan Sundaram, Steven 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)

Recommendations

• Detecting and counting small pattern graphs
• Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
• Detecting and Counting Small Pattern Graphs
• Faster algorithms for finding and counting subgraphs
• Induced subgraph isomorphism: are some patterns substantially easier than others?

Cites work

• scientific article; zbMATH DE number 140499 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Graph minors. XX: Wagner's conjecture

Cited in

(5)

• The challenges of unbounded treewidth in parameterised subgraph counting problems
• Simulation relations for pattern matching in directed graphs
• Efficient algorithms for subgraph listing
• scientific article; zbMATH DE number 2117153 (Why is no real title available?)
• Finding and counting given length cycles

This page was built for publication: Recognizing small subgraphs

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