[Search for users] [Overall Top Noters] [List of all Conferences] [Download this site]

Conference rusure::math

Title:Mathematics at DEC
Moderator:RUSURE::EDP
Created:Mon Feb 03 1986
Last Modified:Fri Jun 06 1997
Last Successful Update:Fri Jun 06 1997
Number of topics:2083
Total number of notes:14613

949.0. "the curse of the clean desk" by HERON::BUCHANAN (and the world it runnes on wheeles) Mon Oct 17 1988 12:50

	I have a feeling that a couple of months ago I was given a paper
by someone concerning a symbolic programming environment specifically
oriented towards GRAPHS (the vertices-and-edges kind, not the trend-plotting
kind).   However, at the time, I had much to do, and no immediate use for
the tool or the paper, and so I filed the document under "lose".

	Alack the day when now I find I need such a thing for a major
math recreational project I'm involved in, and I cannot locate any details.
Help!

	What I'm looking for is "MAXYMA for graphs".   It is not CAYLEY, which
is algebra-oriented.   I understand that recent releases of CAYLEY may include
some graphical facilities, but it seems from tghe prospectus that it's mostly
automorphism-type stuff.   I'm looking for an expressive language which runs
v. fast for establishing equivalence of graphs, deciding whether one graph
contains another subgraph, other run-of-the-mill graph theory stuff.

	Anyone know?

Thanks in advance,
Andrew.
T.RTitleUserPersonal
Name
DateLines
949.1HERON::BUCHANANand the world it runnes on wheelesMon Oct 17 1988 14:157
	There's an ambiguity in my request.   Let me clarify.   I'm not 
interested in graphics, or graph-plotting.   I'm interested in simple graphs.
n vertices, each unordered pair of edges either has an edge or it doesn't.

Sorry.

Andrew