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

On-line matching routing on trees

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

DOI10.1016/S0304-3975(99)00010-9zbMath0954.68010MaRDI QIDQ1575846

Antonios Symvonis, Alan Roberts

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

heap construction


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Many-to-many routing on trees via matchings
  • A unified framework for off-line permutation routing in parallel networks
  • Routing Permutations on Graphs via Matchings
  • Routing permutations on graphs via matchings


This page was built for publication: On-line matching routing on trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1575846&oldid=13860401"
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 01:35.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki