An Algorithm for Scaling Matrices and Computing the Minimum Cycle Mean in a Digraph.

M. von Golitschek

Numerische Mathematik (1980)

  • Volume: 35, page 45-56
  • ISSN: 0029-599X; 0945-3245/e

How to cite

top

Golitschek, M. von. "An Algorithm for Scaling Matrices and Computing the Minimum Cycle Mean in a Digraph.." Numerische Mathematik 35 (1980): 45-56. <http://eudml.org/doc/186308>.

@article{Golitschek1980,
author = {Golitschek, M. von},
journal = {Numerische Mathematik},
keywords = {matrix scaling; preconditioning; digraphs; minimum cycle mean problem},
pages = {45-56},
title = {An Algorithm for Scaling Matrices and Computing the Minimum Cycle Mean in a Digraph.},
url = {http://eudml.org/doc/186308},
volume = {35},
year = {1980},
}

TY - JOUR
AU - Golitschek, M. von
TI - An Algorithm for Scaling Matrices and Computing the Minimum Cycle Mean in a Digraph.
JO - Numerische Mathematik
PY - 1980
VL - 35
SP - 45
EP - 56
KW - matrix scaling; preconditioning; digraphs; minimum cycle mean problem
UR - http://eudml.org/doc/186308
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.