Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1472126

From MaRDI portal
Jump to:navigation, search

zbMATH Open0981.68183MaRDI QIDQ4489178FDOQ4489178


Authors: M. Eduardo Kortright, Arobinda Gupta, Richard B. Borie Edit this on Wikidata


Publication date: 23 October 2000



Title of this publication is not available (Why is that?)



Recommendations

  • Parallel algorithms for series parallel graphs
  • Parallel recognition and decomposition of two terminal series parallel graphs
  • Efficient parallel algorithms for series parallel graphs
  • Computational Science - ICCS 2004
  • Parallel recognition of series-parallel graphs


zbMATH Keywords

recursively decomposable graphs


Mathematics Subject Classification ID

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



Cited In (6)

  • Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
  • Parallel recognition and decomposition of two terminal series parallel graphs
  • Efficiently parallelizable problems on a class of decomposable graphs
  • Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems
  • Computational Science - ICCS 2004
  • Title not available (Why is that?)





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489178)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4489178&oldid=18575425"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 07:15. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki