• nauty

  • Referenced in 561 articles [sw00611]
  • program for computing automorphism groups of graphs and digraphs. It can also produce a canonical ... package. For example, geng can generate non-isomorphic graphs very quickly. There are also generators...
  • KronFit

  • Referenced in 41 articles [sw20428]
  • Kronecker graphs: an approach to modeling networks. How can we generate realistic networks? In addition ... matrix operation, the Kronecker product, to generate graphs which we refer to as “Kronecker graphs ... scalable algorithm for fitting the Kronecker graph generation model to large real networks. A naive ... network structure, and the resulting synthetic graphs can be used for null-models, anonymization, extrapolations...
  • Valgrind

  • Referenced in 58 articles [sw04420]
  • branch-prediction profiler, a call-graph generating cache and branch-prediction profiler, and a heap...
  • GENREG

  • Referenced in 51 articles [sw26671]
  • Fast generation of regular graphs and construction of cages. The construction of complete lists ... regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics ... this article an efficient algorithm to generate regular graphs with a given number of vertices ... regular graphs with girth 5 and minimal number of vertices were generated in less than...
  • plantri

  • Referenced in 62 articles [sw10864]
  • Fast generation of planar graphs. The program Plantri is described. Its principles of operation ... fastest isomorphism-free generator of many classes of planar graphs, including triangulations, quadrangulations and convex...
  • Python Web Graph Generator

  • Referenced in 26 articles [sw05789]
  • Python Web Graph Generator is a threaded Web graph (Power law random graph) generator ... generate a synthetic Web graph of about one million nodes in a few minutes...
  • GraphBase

  • Referenced in 122 articles [sw01555]
  • combinatorial algorithms. The programs generate a large number of graphs with a great variety...
  • gSpan

  • Referenced in 109 articles [sw11908]
  • substructures without candidate generation. gSpan builds a new lexicographic order among graphs, and maps each...
  • AutoGraphiX

  • Referenced in 133 articles [sw06137]
  • extremal graphs could be extracted and conjectures may be generated automatically or found...
  • SNAP

  • Referenced in 41 articles [sw04184]
  • edges. It efficiently manipulates large graphs, calculates structural properties, generates regular and random graphs...
  • huge

  • Referenced in 37 articles [sw08466]
  • Compared with the existing graph estimation package glasso, the huge package provides extra features ... like data-dependent model selection, data generation and graph visualization; (4) a minor convergence problem...
  • CGAL

  • Referenced in 360 articles [sw00118]
  • Finally, the Support Library offers geometric object generators and spatial sorting functions, as well ... libraries Qt, Geomview, and the Boost Graph Library...
  • TGFF

  • Referenced in 15 articles [sw17689]
  • flexible and standard way of generating pseudo-random task-graphs for use in scheduling ... strives to be general-purpose, it generates graphs and associated resource parameters in accordance with ... database specifications and thereby allows the generation of graphs tailored to particular domains...
  • SparseMatrix

  • Referenced in 638 articles [sw04629]
  • experiments: robust because performance results with artificially-generated matrices can be misleading, and repeatable because ... statistics, power networks, and other networks and graphs). We provide software for accessing and managing...
  • sna

  • Referenced in 19 articles [sw07318]
  • structural equivalence detection, network regression, random graph generation, and 2D/3D network visualization...
  • CUTE

  • Referenced in 63 articles [sw00177]
  • part of unit can be tested by generating inputs for a single entry function ... inputs to the unit are memory graphs. The paper addresses the problem of automating unit ... testing with memory graphs as inputs. The approach used builds on previous work combining symbolic ... graphs as inputs. Moreover, an efficient constraint solver is proposed to facilitate incremental generation...
  • snarkhunter

  • Referenced in 19 articles [sw26975]
  • Snarks: Snarkhunter is a generator for connected cubic graphs and snarks. Snarks are cyclically ... edge connected cubic graphs with chromatic index 4 and girth at least ... also be used to generate connected cubic graphs and snarks with girth at least...
  • TABARIS

  • Referenced in 16 articles [sw02534]
  • graph. A technique for finding in a graph an independent set with maximum cardinality ... obtained; the case of randomly generated graphs having up to 450 or 500 nodes (with...
  • CaGe

  • Referenced in 19 articles [sw21206]
  • Studying Some Special Classes of Plane Graphs. CaGe is an Open Source software package, implemented ... Java. CaGe’s task is to generate mathematical graphs of different types -- often types that...