Graph approach to solving problems of combinatorial recognition (Q1699396): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10559-017-9987-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2770461062 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial algorithms making support of managerial decisions / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:55, 15 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graph approach to solving problems of combinatorial recognition |
scientific article |
Statements
Graph approach to solving problems of combinatorial recognition (English)
0 references
23 February 2018
0 references
limited sample
0 references
unlimited sample
0 references
complete graph
0 references
bipartite graph
0 references
search graph
0 references
active ball
0 references
active edge
0 references
positive test result
0 references
negative test result
0 references