Polynomial algorithms to finite Veber problem for a tree network

Volume: 35, Issue: 1-3, Pages: 291 - 296
Published: Jun 1, 1991
Abstract
A polynomial algorithm to a finite Veber problem for a tree network is presented. Space- and time-complexity estimations of this algorithm are given. The space complexity of this algorithm may be decreased for problems with an algorithmic representation of some input data. Examples of such problems and algorithms to them...
Paper Details
Title
Polynomial algorithms to finite Veber problem for a tree network
Published Date
Jun 1, 1991
Volume
35
Issue
1-3
Pages
291 - 296
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.