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

nauty
 Referenced in 406 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...

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

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

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

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

Graphplan
 Referenced in 161 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 223 articles
[sw04076]
 Nearest Neighbor is the Spectral Graph Transducer. SVMlight can also train SVMs with cost models...

polymake
 Referenced in 208 articles
[sw00724]
 dealing with simplicial complexes, matroids, polyhedral fans, graphs, tropical objects, and other objects. Computer algebra...

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

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

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

Chaco
 Referenced in 101 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...

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

gSpan
 Referenced in 80 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...

Algorithm 447
 Referenced in 87 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...

GrabCut
 Referenced in 82 articles
[sw15842]
 GrabCut: interactive foreground extraction using iterated graph cuts. The problem of efficient, interactive foreground/background segmentation ... Recently, an approach based on optimization by graphcut has been developed which successfully combines ... information. In this paper we extend the graphcut approach in three respects. First...

ParMETIS
 Referenced in 77 articles
[sw04697]
 variety of algorithms for partitioning unstructured graphs, meshes, and for computing fillreducing orderings ... based on the parallel multilevel kway graphpartitioning, adaptive repartitioning, and parallel multiconstrained...

Scotch
 Referenced in 55 articles
[sw07818]
 modeled in terms of weighted unoriented graphs, this problem amounts to static graph mapping. This ... Scotch, a software package devoted to graph mapping, based on the Dual Recursive Bipartitioning algorithm ... recursive application of any of several graph bipartitioning methods, including FiducciaMattheyses, GibbsPooleStockmeyer ... methods. Scotch can map any weighted process graph onto any weighted target graph, whether they...