Optimizing concurrency under Scheduling by Edge Reversal
From MaRDI portal
Publication:6087133
approximationNP-completenessschedulingconcurrencydistributed systemslongest cyclecoloringedge reversal
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Edge-Chromatic Scheduling with Simultaneity Constraints
- scientific article; zbMATH DE number 2087170
- Refinement of Timing Constraints for Concurrent Tasks with Scheduling
- In the search for optimal concurrency
- Scheduling with Concurrency-Based Constraints
- Synchronized sweep algorithms for scalable scheduling constraints
- Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory
- Scheduling in synchronous networks and the greedy algorithm
- Edge finding for cumulative scheduling
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1472189 (Why is no real title available?)
- scientific article; zbMATH DE number 944424 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- A lower bound on the period length of a distributed scheduler
- Algorithmic Composition
- Algorithmic graph theory and its applications
- Clique-width: on the price of generality
- Complexity of network synchronization
- Efficient Planarity Testing
- Every planar map is four colorable. I: Discharging
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- Geometric algorithms and combinatorial optimization
- Long directed \((s,t)\)-path: FPT algorithm
- NP-hardness of shop-scheduling problems with three jobs
- Node-and edge-deletion NP-complete problems
- On approximating the longest path in a graph
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
- Parameterized algorithms
- Principles of Distributed Systems
- Recognizing Berge graphs
- Searching and pebbling
- Some simplified NP-complete graph problems
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The ellipsoid method and its consequences in combinatorial optimization
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The multichromatic numbers of some Kneser graphs
- Three short proofs in graph theory
This page was built for publication: Optimizing concurrency under Scheduling by Edge Reversal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087133)
