Graph approach to solving problems of combinatorial recognition

DOI10.1007/S10559-017-9987-6MaRDI QIDQ1699396zbMATH OpenOpenAlexFDO

Authors Georg A. Donets

Publication date 23 February 2018

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-017-9987-6

zbMATH Keywords

bipartite graphcomplete graphactive ballactive edgelimited samplenegative test resultpositive test resultsearch graphunlimited sample

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 3929036
• A survey of graph structure descriptions in pattern recognition
• Recognition of graphs by automata
• scientific article; zbMATH DE number 3896983
• The recognition problem of graph search trees
• Discontinuities in the complexities of some graph recognition problems
• Applied graph theory in computer vision and pattern recognition
• Some recognition problems related to graph isomorphism

Cites work

• Combinatorial algorithms making support of managerial decisions

Cited in

(6)

• Combinatorial configurations in the definition of antimagic labelings of graphs
• scientific article; zbMATH DE number 3896983 (Why is no real title available?)
• scientific article; zbMATH DE number 1964826 (Why is no real title available?)
• Optical Graph Recognition
• Recognition of graphs by automata
• Combinatorial algorithms making support of managerial decisions

This page was built for publication: Graph approach to solving problems of combinatorial recognition

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