Finding patterns in an unknown graph

DOI10.3233/AIC-2012-0532MaRDI QIDQ3164974zbMATH OpenOpenAlexFDO

Authors Roni Stern, Meir Kalech, Ariel Felner

Publication date 25 October 2012

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-2012-0532

zbMATH Keywords

heuristic searchsubgraph isomorphismunknown graphs

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35)

Recommendations

• Exploring an unknown graph
• Mining graph patterns
• Finding approximate patterns in undirected acyclic graphs
• Finding common structured patterns in linear graphs
• Querying regular graph patterns
• Exploring Unknown Undirected Graphs
• scientific article; zbMATH DE number 1303571
• scientific article; zbMATH DE number 5263405
• Detecting and Counting Small Pattern Graphs

Cited in

(7)

• Efficiently searching a graph by a smell-oriented vertex process
• Detecting and Counting Small Pattern Graphs
• scientific article; zbMATH DE number 33703 (Why is no real title available?)
• Exploring an unknown graph
• Exploring Unknown Undirected Graphs
• scientific article; zbMATH DE number 5263405 (Why is no real title available?)
• Discovering bands from graphs

This page was built for publication: Finding patterns in an unknown graph

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