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 432767

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

zbMATH Open0800.68637MaRDI QIDQ3138895FDOQ3138895


Authors: Michael Luby, Paul Beame Edit this on Wikidata


Publication date: 19 September 1994



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




zbMATH Keywords

parallel searchmaximal independencerandomized NC algorithm


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65) Distributed algorithms (68W15)



Cited In (5)

  • Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set
  • On subgraphs of bounded degeneracy in hypergraphs
  • On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
  • A global parallel algorithm for the hypergraph transversal problem
  • An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3





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 Q3138895)

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