Presents a mathematical justification of the technique of force-directed scheduling and propose two modifications of the basic algorithm introduced by Paulin and Knight. The newly presented modifications improve the effectiveness of force-directed scheduling without affecting its time complexity. This is illustrated by an empirical performance analysis based on a number of problem instances
Wim VerhaeghEmile AartsJan KorstP.E.R. Lippens
Wim VerhaeghP.E.R. LippensEmile AartsJan KorstJ.L. van MeerbergenA. van der Werf
Emden R. GansnerStephen C. North
VerhaeghLippensAartsKorstSylvie van der Werfvan Meerbergen
Wim VerhaeghP.E.R. LippensEmile AartsJan KorstA. van der WerfJ.L. van Meerbergen