2025-02-23T15:37:31-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22open-sciencenbuvgovua-61473%22&qt=morelikethis&rows=5
2025-02-23T15:37:31-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22open-sciencenbuvgovua-61473%22&qt=morelikethis&rows=5
2025-02-23T15:37:31-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T15:37:31-05:00 DEBUG: Deserialized SOLR response
About numeric graphs nodes matching
Saved in:
Main Authors: | I. E. Shulinok, G. A. Shulinok |
---|---|
Format: | Article |
Language: | English |
Published: |
2015
|
Series: | Teoriia optymalnykh rishen |
Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000475027 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
2025-02-23T15:37:31-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&rows=40&rows=5&wt=json&json.nl=arrarr&q=id%3A%22open-sciencenbuvgovua-61473%22&qt=morelikethis
2025-02-23T15:37:31-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&rows=40&rows=5&wt=json&json.nl=arrarr&q=id%3A%22open-sciencenbuvgovua-61473%22&qt=morelikethis
2025-02-23T15:37:31-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T15:37:31-05:00 DEBUG: Deserialized SOLR response
Similar Items
-
About numeric graphs nodes matching
by: I. E. Shulinok, et al.
Published: (2016) -
Maximum Matching in Weighted Bipartite Graphs
by: Kyyko, V.M.
Published: (2018) -
Maximum Matching in Weighted Bipartite Graphs
by: V. M. Kyyko
Published: (2018) -
On the shortest k-node path in a directed graph
by: P. I. Stetsjuk, et al.
Published: (2016) -
Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph
by: P. I. Stetsjuk
Published: (2016)