scientific article; zbMATH DE number 33703

MaRDI QIDQ3989040zbMATH OpenFDO

Authors Sergei O. Kuznetsov

Publication date 28 June 1992

zbMATH Keywords

automatic hypothesis generationpattern recognition

Mathematics Subject Classification ID

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

Recommendations

• The complexity of searching a graph
• Finding approximate patterns in undirected acyclic graphs
• Finding patterns in an unknown graph
• scientific article; zbMATH DE number 1538872
• The complexity of searching succinctly represented graphs
• Search problems on graphs
• Complexity, Graphs, and the Dependency Pair Method
• scientific article; zbMATH DE number 820118
• An analysis of repeated graph search

Cited in

(5)

• On interestingness measures of formal concepts
• Parallel algorithm for computing fixpoints of Galois connections
• Computational aspects of mining maximal frequent patterns
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• Mathematical aspects of concept analysis

This page was built for publication:

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