2025-02-24T00:39:32-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84928%22&qt=morelikethis&rows=5
2025-02-24T00:39:32-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84928%22&qt=morelikethis&rows=5
2025-02-24T00:39:32-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-24T00:39:32-05:00 DEBUG: Deserialized SOLR response
Полиномиальность нахождения оценок в общей задаче синтеза надежных сетей
We consider the design minimum cost network problem under requirement that if edges of any isomorphic subgraph to given a graph, are deleted from the network then there exist a path between every pair of distinct nodes in the network. It is shown that when the graph has a simple structure the upper...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Інститут кібернетики ім. В.М. Глушкова НАН України
2005
|
| Series: | Теорія оптимальних рішень |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/84928 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We consider the design minimum cost network problem under requirement that if edges of any isomorphic subgraph to given a graph, are deleted from the network then there exist a path between every pair of distinct nodes in the network. It is shown that when the graph has a simple structure the upper and lower bounds for this problem can be defined by polynomial time algorithm. |
|---|