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:4028881
Jump to:navigation, search

zbMath0767.68049MaRDI QIDQ4028881

Mark B. Novick, Joseph (Seffi) Naor, Marek Chrobak

Publication date: 28 March 1993


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

zbMATH Keywords

perfect matchingclaw-free graphsline graphsEREW PRAMparallel NC algorithmCRCW PRAMreconstructing a root graph


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)


Related Items (3)

An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs ⋮ On the Parameterized Parallel Complexity and the Vertex Cover Problem ⋮ On some graphs with a unique perfect matching







This page was built for publication:

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