Data dependent circuit for subgraph isomorphism problem

DOI10.1007/3-540-46117-5_109MaRDI QIDQ4408259zbMATH OpenFDO

Authors Shuichi Ichikawa, Shoji Yamamoto

Publication date 29 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2438/24381068.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Recommendations

• Efficient Suboptimal Graph Isomorphism
• Minimum circuit size, graph isomorphism, and related problems
• Minimum circuit size, graph isomorphism, and related problems
• Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation
• scientific article; zbMATH DE number 2097443
• An Algorithm Portfolio for the Sub-graph Isomorphism Problem
• An optimally data efficient isomorphism inference algorithm
• New data structures for subgraph connectivity

This page was built for publication: Data dependent circuit for subgraph isomorphism problem

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