Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An efficient P-D algorithm for shortest path problem

From MaRDI portal
Publication:1367256
Jump to:navigation, search

DOI10.1007/BF02015143zbMath1043.90554MaRDI QIDQ1367256

Shuli Liang, Cheng'en Yang

Publication date: 1997

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)



Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)




Cites Work

  • A note on two problems in connexion with graphs
  • A primal-dual algorithm for the minimum average weighted length circuit problem
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: An efficient P-D algorithm for shortest path problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1367256&oldid=13515193"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki