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

scientific article; zbMATH DE number 3894490

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

zbMATH Open0561.68052MaRDI QIDQ5186752FDOQ5186752

Anton T. Dahbura

Publication date: 1984



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



Recommendations

  • scientific article
  • An approximation of the minimum vertex cover in a graph
  • scientific article
  • scientific article; zbMATH DE number 3853131
  • Minimum covering algorithm on bipartite graph


zbMATH Keywords

algorithmundirected graphminimum vertex coverexternal graph


Mathematics Subject Classification ID

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



Cited In (3)

  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • A greedy algorithm to construct covering arrays using a graph representation





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

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