Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Graph approach to solving problems of combinatorial recognition

From MaRDI portal
Publication:1699396
Jump to:navigation, search

DOI10.1007/S10559-017-9987-6zbMath1398.90135OpenAlexW2770461062MaRDI QIDQ1699396

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

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


Related Items (1)

Combinatorial configurations in the definition of antimagic labelings of graphs




Cites Work

  • Combinatorial algorithms making support of managerial decisions




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1699396&oldid=14018370"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 05:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki