some remarks on convex network flows for k-spiders
Clicks: 132
ID: 168489
2015
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
132 views
22 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #458 of 1,093 articles by views in journal of power sources
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,093 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
We consider convex functions modeling flows in an arborescent network. The notion of majorization on trees is used to study some classical convexity results in this framework.
| Reference Key |
mlin2015mathematicalsome
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Maria Mălin;Ionel Rovenţa |
| Journal | journal of power sources |
| Year | 2015 |
| DOI |
10.1155/2015/710516
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.