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

Shortest shortest path trees of a network

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

DOI10.1016/0166-218X(95)00038-SzbMath0851.05042MaRDI QIDQ1917275

Mao Lin Zheng, Pierre Hansen

Publication date: 21 November 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)


zbMATH Keywords

networkcomplexityalgorithmsshortest path treespanning tree


Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items

The minimum cost shortest-path tree game


Uses Software

  • Algorithm 97


Cites Work

  • A note on two problems in connexion with graphs
  • A Theorem on Boolean Matrices
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1917275&oldid=14335681"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 15:36.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki