#### Filter Results:

#### Publication Year

1996

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning problem is to divide so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges separating these pieces is minimised. Important examples of the problem arise in partitioning graphs known as meshes for the… (More)

Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning problem is to divide so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges separating these pieces is minimised. Important examples of the problem arise in partitioning graphs known as meshes for the… (More)

1. We have studied the characteristics of the abnormal properties of damaged myelinated fibers (conduction velocity > 2.0 m/ s) after peripheral nerve injury in a novel in vitro model of the rat sciatic nerve/dorsal root ganglion/dorsal root (L4-5) preparation removed from control naíve or sham-operated rats and animals that had received sciatic neurectomy… (More)

For a scheduling problem on parallel machines, the power of preemption is defined as the ratio of the makespan of an optimal non-preemptive schedule over the makespan of an optimal preempt-ive schedule. For m uniform parallel machines, we give the necessary and sufficient conditions under which the global bound of 2 − 1/m is tight. If the makespan of the… (More)

(2013) Preemptive scheduling on two identical parallel machines with a single transporter.