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

scientific article

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

zbMath0981.68118MaRDI QIDQ2752462

Paraskevi Fragopoulou, David W. Krumme

Publication date: 7 January 2002

Full work available at URL: https://eudml.org/doc/121680

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

networkalgorithmgraphcommunications


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)


Related Items (5)

An improved algorithm for the \(k\)-source maximum eccentricity spanning trees ⋮ A new bound of radius with irregularity index ⋮ The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. ⋮ Multi-source spanning trees: Algorithms for minimizing source eccentricities. ⋮ Minimax flow tree problems




This page was built for publication:

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