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

Efficient parallel algorithms for planar \(st\)-graphs

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

DOI10.1007/s00453-002-0995-0zbMath1045.68161OpenAlexW217231717MaRDI QIDQ1400882

Danny Z. Chen, Ovidiu Daescu, Mikhail J. Atallah

Publication date: 17 August 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0995-0


zbMATH Keywords

AlgorithmsParallel computingPartitioningEREW PRAMSortingMergingMulti-selection


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)





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