Computational experiments with a lazy version of a K quickest simple path ranking algorithm
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Derks, Jean & Peters, Hans, 1993. "A Shapley Value for Games with Restricted Coalitions," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(4), pages 351-360.
- Michel Grabisch & Jacques Duchêne & Frédéric Lino & Patrice Perny, 2002. "Subjective Evaluation of Discomfort in Sitting Position," Post-Print halshs-00273179, HAL.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
More about this item
KeywordsGraph algorithms; Networks; Quickest path; Ranking; 90C27; 90C35;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:15:y:2007:i:2:p:372-382. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .
We have no references for this item. You can help adding them by using this form .