
Magma
 Referenced in 2347 articles
[sw00540]
 groups, rings, fields, modules, algebras, schemes, curves, graphs, designs, codes and many others. Magma also...

DLMF
 Referenced in 1473 articles
[sw04968]
 data to be covered include mathematical formulas, graphs, references, methods of computation, and links...

nauty
 Referenced in 486 articles
[sw00611]
 graphtheoretic program NAUTY: nauty is a program for computing automorphism groups of graphs ... example, geng can generate nonisomorphic graphs very quickly. There are also generators for bipartite ... graphs, digraphs, and multigraphs...

SparseMatrix
 Referenced in 522 articles
[sw04629]
 statistics, power networks, and other networks and graphs). We provide software for accessing and managing ... well as an online search capability. Graph visualization of the matrices is provided...

METIS
 Referenced in 404 articles
[sw04089]
 serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings...

CGAL
 Referenced in 305 articles
[sw00118]
 libraries Qt, Geomview, and the Boost Graph Library...

GeoGebra
 Referenced in 293 articles
[sw04203]
 education that joins geometry, algebra, tables, graphing, statistics and calculus in one easy...

polymake
 Referenced in 260 articles
[sw00724]
 fans as well as simplicial complexes, matroids, graphs, tropical hypersurfaces, and other objects. Supported platforms...

Graphplan
 Referenced in 176 articles
[sw07746]
 Fast planning through planning graph analysis. We introduce a new approach to planning in STRIPS ... compact structure we call a planning graph. We describe a new planner, Graphplan, that uses...

SVMlight
 Referenced in 242 articles
[sw04076]
 Nearest Neighbor is the Spectral Graph Transducer. SVMlight can also train SVMs with cost models...

LEDA
 Referenced in 240 articles
[sw00509]
 core computer science areas  data structures, graph and network algorithms, and computational geometry  LEDA...

GRAFFITI
 Referenced in 135 articles
[sw07495]
 introduces a computer program, Graffiti, which makes graphtheoretical conjectures. Graffiti has a library ... certain types of graphs and it is capable of evaluating formulas formed from graphtheoretical ... conjecture if none of the graphs known by the program is an counterexample. The structure...

AutoGraphiX
 Referenced in 123 articles
[sw06137]
 computer system designed to help researchers in graph theory. The main purpose ... search for extremal graphs, i.e., graphs minimizing of maximizing a graph invariant (or a function ... graph invariants, which could also be considered as an invariant). From this main capability, some ... information on the extremal graphs could be extracted and conjectures may be generated automatically...

GraphBase
 Referenced in 103 articles
[sw01555]
 programs generate a large number of graphs with a great variety of properties. Some ... graphs are based on data from the “real world”: Fiveletter words of English ... mathematical constructions such as lattices and quaternions. Graphs can be modified and combined by union ... intersection, complementation, product, and forming line graphs. A general inducedgraph routine allows omission and/or...

igraph
 Referenced in 111 articles
[sw07066]
 creating and manipulating undirected and directed graphs. It includes implementations for classic graph theory problems ... implementation of igraph allows it to handle graphs with millions of vertices and edges ... rule of thumb is that if your graph fits into the physical memory then igraph...

Graphs
 Referenced in 102 articles
[sw12277]
 first presented with a network (graph). A socalled preprocessing algorithm may compute certain information ... query time. We survey methods for general graphs as well as specialized methods for restricted ... graph classes, in particular for those classes with arguable practical significance such as planar graphs...

MIM
 Referenced in 101 articles
[sw26139]
 form of multivariate analysis that uses graphs to represent models. These graphs display the structure ... Chapter 7 describes the use of directed graphs, chain graphs, and other graphs. Chapter...

Algorithm 447
 Referenced in 111 articles
[sw12877]
 Algorithm 447: effcient algorithms for graph manipulation. Efficient algorithms are presented for partitioning a graph ... paths. The algorithm for partitioning of a graph into simple paths of iterative and each...

Chaco
 Referenced in 110 articles
[sw09640]
 Chaco: Software for Partitioning Graphs. Before a calculation can be performed on a parallel computer ... problem can be addressed in terms of graph partitioning. Rob Leland and I have developed ... variety of algorithms for graph partitioning and implemented them into a package we call Chaco...

gSpan
 Referenced in 92 articles
[sw11908]
 gSpan: graphbased substructure pattern mining. We investigate new approaches for frequent graphbased pattern ... mining in graph datasets and propose a novel algorithm called gSpan (graphbased substructure pattern ... gSpan builds a new lexicographic order among graphs, and maps each graph to a unique...