An efficient algorithm for generating AoA networks

Details An efficient algorithm for generating AoA networks An efficient algorithm for generating AoA networks

2012-03-14

arxiv.org/abs/1203.3203v1

IJCSI, Vol. 9, Issue 1, No 1, January 2012

Computer Science

Discrete Mathematics

7 pages, 16 figures

Scientific paper

The activities, in project scheduling, can be represented graphically in two different ways, by either assigning the activities to the nodes 'AoN' directed acyclic graph (dag) or to the arcs 'AoA dag'. In this paper, a new algorithm is proposed for generating, for a given project scheduling problem, an Activity-on-Arc dag starting from the Activity-on-Node dag using the concepts of line graphs of graphs.

Affiliated with

Also associated with

No associations

Rating

An efficient algorithm for generating AoA networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An efficient algorithm for generating AoA networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient algorithm for generating AoA networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29415