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

Distributed algorithms for finding and maintaining a \(k\)-tree core in a dynamic network

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

DOI10.1016/S0020-0190(03)00365-XzbMath1178.68666MaRDI QIDQ1029012

Saurabh Srivastava, Ratan K. Ghosh

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)


zbMATH Keywords

distributed algorithmsroutingad hoc networks\(k\)-corerooted core


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)




Cites Work

  • A simple optimal parallel algorithm for a core of a tree
  • Algorithms for a Core and k-Tree Core of a Tree




This page was built for publication: Distributed algorithms for finding and maintaining a \(k\)-tree core in a dynamic network

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