Graph approach to solving problems of combinatorial recognition

DOI10.1007/S10559-017-9987-6zbMATH Open1398.90135OpenAlexW2770461062MaRDI QIDQ1699396FDOQ1699396

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

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

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)

Cites Work

• Combinatorial algorithms making support of managerial decisions

Cited In (6)

• Title not available (Why is that?)
• Combinatorial algorithms making support of managerial decisions
• Title not available (Why is that?)
• Combinatorial configurations in the definition of antimagic labelings of graphs
• Optical Graph Recognition
• Recognition of graphs by automata

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)