Journal of Graph Algorithms and Applications

Journal of Graph Algorithms and Applications

Post by Roberto Tamassi » Sat, 16 Dec 1995 04:00:00

*                                                                       *
*                    ANNOUNCEMENT AND CALL FOR PAPERS                   *
*                                                                       *
*                                                                       *
*                                                                       *
*                    *
*                                                                       *


ADVISORY BOARD (preliminary):

S. Even, Technion
G. N. Frederickson, Purdue University
T. C. Hu, University of California at San Diego
C. L. Liu, University of Illinois
K. Mehlhorn, Max-Planck-Institut fur Informatik
F. P. Preparata, Brown University
I. H. Sudborough, University of Texas at Dallas
R. E. Tarjan, Princeton University and NEC Research Institute
M. Yannakakis, AT&T Bell Laboratories

EDITORIAL BOARD (preliminary):

G. Di Battista, University of Rome
P. Eades, University of Newcastle
D. Eppstein, University of California at Irvin
A. Gibbons,University of Warwick
M. T. Goodrich, Johns Hopkins University
A. Itai, Technion
A. Kahng, University of California at Los Angeles
Y. Kajitani, Tokyo Institute of Technology
M. Kaufmann, Universitat Tubingen
J. S. B. Mitchell, State University of New York at Stony Brook
T. Nishizeki, Tohoku University


The Journal of Graph Algorithms and Applications (JGAA) is a new
electronic journal that is available on the World Wide Web.
JGAA has high scientific standards and takes advantage of current
electronic document technology.

The electronic format will allow the authors to add various useful
appendices to their articles after publication, including corrections,
implementations, multimedia animations, conference presentations,
examples, and extended bibliographies.

A ``first volume'' consisting of 5-7 papers is planned for the Fall of
1996.  Further articles will be made available on the Web as soon as
they are accepted.

The volumes of JGAA will be available for distribution in printed
form to libraries until archival standards for digital libraries
are established.


Topics of interest include but are not limited to:

     *  Design and analysis of graph algorithms:  exact and
        approximation graph algorithms; centralized and distributed
        graph algorithms; static and dynamic graph algorithms;
        internal- and external-memory  graph algorithms; sequential and
        parallel graph algorithms; deterministic and randomized graph

     *  Experiences with graph algorithms:  animations;
        experimentations; implementations.

     *  Applications of graph algorithms:  computational
        biology; computational geometry; computer graphics;
        computer-aided design; computer and interconnection networks;
        constraint systems; databases; graph drawing; graph embedding
        and layout; knowledge representation; multimedia; software
        engineering; telecommunication networks; user interfaces and
        visualization; VLSI circuits; World-Wide Web.


Papers describing original research and surveys addressing emerging
areas are being sought.

Papers should be submitted to one of the Editors-in-Chief in electronic
form (postscript, LaTeX, or HTML).  Multiple files should be sent
possibly as uuencoded compressed tar archives.  Authors may request at
the time of submission that a specific member of the editorial board
handle their paper.  All communications between the editors, authors,
and reviewers will be done by email.

The editors firmly believe that fast review time is an essential
component of scholarly practice.  JGAA will try to keep the review time
within six months.

*                    *


1. Set based algorithms in SQL for directed, acyclic graphs


I have used the nested set technique for a number of years to accelerate
queries into relatively static

hierarchical data structures that are implemented in SQL.

I've been working on some algorithms that will now allow me to manipulate
large directed, acyclic graphs.

The technique is relatively similiar to the graph techniques in the SQL for
Smarties book. The technique

is very much edge based.

The problem with this approach is that the number of passes over the edge
table is proportional to the number

of edges in the graph. The response time of this approach is unacceptable
for graphs with 250,000 edges.

I have google searched the net and newsgroups, as well as searched the ACM
digital library for faster set based

approaches. There doesnt appear to be much published about set based
manipulation of these types of graphs.

Do you know of any techniques or modifications to the edge table that can
accelerate these algorithms by 2 or 3

orders of magnitude? I am looking for something clever like "the nested
sets" approach.

I appreciate any thoughts you are willing to offer.

Bob Zigon

2. HELP! isqlw_wce won't run on iPAQ (Failed to initialize the provider)

3. Hyper Graph using Graham's Reduction Algorithm ?

4. Tempdb permissions problem

5. Hyper Graph Using Graham's Reduction Algorithm ?

6. Help: Informix ESQL-C and Alloc Mem

7. Graph algorithms in modelling and DBMS

8. Algorithm for OUTLAY of planar entities relationship graphs, PLEASE

9. Scheduling/routing people movement algorithm/application

10. ANNOUNCE: Charts & Graphs for WWW Applications

11. ANNOUNCE: Charts and Graphs for your WWW applications

12. Microsoft Graph 97 Applications