Applications of parallel scheduling to perfect graphs. Technical report
Technical Report
·
OSTI ID:6978660
The authors combine a parallel algorithm for the two processor-scheduling problem, which runs in polylog time on a polynomial number of processors, with an algorithm to find transitive orientations of graphs where they exist. Both algorithms together solve the maximum-clique problem and the maximum-coloring problem for co-comparability graphs. These parallel algorithms can also be used to identify permutation graphs and interval graphs, important subclasses of perfect graphs.
- Research Organization:
- Stanford Univ., CA (USA). Dept. of Computer Science
- OSTI ID:
- 6978660
- Report Number(s):
- AD-A-172043/2/XAB; STAN-CS-86-1118
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fast and processor-efficient parallel algorithms for reducible-flow graphs. Technical report
Fast parallel algorithms for graph-theoretic problems: matching, coloring, and partitioning
Parallel complexity of discrete problems
Technical Report
·
Mon Oct 31 23:00:00 EST 1988
·
OSTI ID:5891164
Fast parallel algorithms for graph-theoretic problems: matching, coloring, and partitioning
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5062298
Parallel complexity of discrete problems
Thesis/Dissertation
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:5856801