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 5263424

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

zbMATH Open1134.68325MaRDI QIDQ5457679FDOQ5457679


Authors: C. Tadonki Edit this on Wikidata


Publication date: 14 April 2008



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



Recommendations

  • scientific article; zbMATH DE number 2247684
  • scientific article; zbMATH DE number 2203358
  • Scheduling with undirected graphs: motivations and reviews
  • scientific article; zbMATH DE number 2050889
  • Systolic algorithms for some scheduling and graph problems
  • A graph coloring algorithm for large scale scheduling problems
  • scientific article; zbMATH DE number 4049080
  • Scheduling Graphs on Two Processors


zbMATH Keywords

graphparallel algorithmparallel machinescheduleallocation functiontiming function


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)



Cited In (4)

  • A Graphical Foundation for Schedules
  • Extension of Rescheduling Based on Minimal Graph Cut
  • Title not available (Why is that?)
  • 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 Q5457679)

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