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

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

nauty
 Referenced in 549 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 601 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 438 articles
[sw04089]
 serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings...

TensorFlow
 Referenced in 240 articles
[sw15170]
 library for numerical computation using data flow graphs. Nodes in the graph represent mathematical operations ... while the graph edges represent the multidimensional data arrays (tensors) communicated between them. The flexible...

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

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

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

GRAFFITI
 Referenced in 160 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...

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

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

Graphplan
 Referenced in 181 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...

AutoGraphiX
 Referenced in 132 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...

igraph
 Referenced in 142 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...

GraphBase
 Referenced in 119 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...

MIM
 Referenced in 121 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 136 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...

Traces
 Referenced in 126 articles
[sw07823]
 Search Space Contraction in Canonical Labeling of Graphs. The individualizationrefinement paradigm for computing ... labeling and the automorphism group of a graph is investigated. A new algorithmic design aimed ... making computation feasible for several classes of graphs which are hard for all the main...

Graphs
 Referenced in 104 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...