Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs

Authors:
Hanna Furmańczyk;Adrian Kosowski;Paweł Żyliński
Affiliations:
University of Gdańsk, Poland, Institute of Computer Science;Gdańsk University of Technology, Poland, Department of Algorithms and System Modeling;University of Gdańsk, Poland, Institute of Computer Science and Gdańsk University of Technology, Poland, Department of Algorithms and System Modeling
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 5
Cited 1

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Scheduling UET-UCT series-parallel graphs on two processors

Theoretical Computer Science
Scheduling series-parallel orders subject to 0/1-communication delays

Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Coloring some classes of mixed graphs

Discrete Applied Mathematics
On two coloring problems in mixed graphs

European Journal of Combinatorics

Note: Complexity of two coloring problems in cubic planar bipartite mixed graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the mixed graph coloring problem which is used for formulating scheduling problems where both incompatibility and precedence constraints can be present. We give an O(n3.376 log n) algorithm for finding an optimal schedule for a collection of jobs whose constraint relations form a mixed series-parallel graph.