On Two-Processor Scheduling and Maximum Matching in Permutation Graphs.
Sarnath RamnathSivaprakasam SunderPublished in: Inf. Process. Lett. (1996)
Keyphrases
- maximum matching
- bipartite graph
- parallel processors
- stable set
- multiprocessor systems
- scheduling problem
- series parallel
- high speed
- resource allocation
- round robin
- scheduling algorithm
- graph theory
- link prediction
- parallel machines
- graph structure
- single chip
- reinforcement learning
- connected graphs
- resource constraints
- graph mining