Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: notesfiles
Path: utzoo!watmath!clyde!cbosgd!ukma!psuvm.bitnet!psuvax1!burdvax!sdcrdcf!hplabs!hp-pcd!orstcs!kazi
From: kazi@orstcs.UUCP (kazi)
Newsgroups: net.research
Subject: incremental DAG layout algorithm
Message-ID: <16100002@orstcs.UUCP>
Date: Thu, 16-Jan-86 21:57:00 EST
Article-I.D.: orstcs.16100002
Posted: Thu Jan 16 21:57:00 1986
Date-Received: Tue, 21-Jan-86 07:09:48 EST
Organization: Oregon State University - Corvallis, OR
Lines: 11
Nf-ID: #N:orstcs:16100002:000:345
Nf-From: orstcs!kazi    Jan 16 18:57:00 1986

Is there anybody out there who know of any "incremental DAG (directed acyclic
graph) layout algorithm. If there exists such an algorithm, I will highly
appreciate if you could send me the reference to it via email. Thank you
in advance or send US mail.
          -Kazi Ahmed-
          Computer Science
          Oregon State University
          Corvallis, Or 97331