INGRID: A graph invariant manipulator
INGRID, a software system for assisting researchers and students of graph theory, is described. It is a partial commentative rule-based system using forward chaining, consists of approximately 1200 production rules, and is written in Berkeley Pascal on a VAX 11/780 under UNIX. INGRID has a data base of 36 graphical invariants and approximately 350 theorems symbolically relating these invariants. A set of one or more user- supplied restrictions upon the values of some invariants is propagated by INGRID, via the theorems, into intervals of possible values for other of the invariants. With the simple user interface provided by INGRID, even a graph theory novice can often discern properties of a graph that might normally require the capabilities of a well-informed expert.
- scientific article; zbMATH DE number 3849229
- A Rewriting Approach to Graph Invariants
- Inductive graph invariants and algorithmic applications
- Inductive graph invariants and approximation algorithms
- A computational approach to construct a multivariate complete graph invariant
- INVARIANTS OF GRAPHS
- A framework for in-place graph algorithms
- On the reconstruction of graph invariants
- A bound on the spectral radius of graphs with \(e\) edges
- A compilation of relations between graph invariants
- Graph theory with applications
- scientific article; zbMATH DE number 3849229 (Why is no real title available?)
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- MACSYMA from F to G
- The Enumeration of Locally Restricted Graphs (I)
- GrInvIn in a nutshell
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Automated conjecturing. III. Property-relations conjectures
- Computers and discovery in algebraic graph theory
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- scientific article; zbMATH DE number 3849229 (Why is no real title available?)
- Software systems for research in graph theory
- A compilation of relations between graph invariants—supplement I
- scientific article; zbMATH DE number 975361 (Why is no real title available?)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- A survey of automated conjectures in spectral graph theory
- Bounds and conjectures for the signless Laplacian index of graphs
This page was built for publication: INGRID: A graph invariant manipulator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1113914)