• GENREG

  • Referenced in 60 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 ... article an efficient algorithm to generate regular graphs with a given number of vertices ... graphs, like construction of the 4-regular graphs on 18 vertices and, for the first...
  • Magma

  • Referenced in 3296 articles [sw00540]
  • groups, rings, fields, modules, algebras, schemes, curves, graphs, designs, codes and many others. Magma also ... users to report any bugs they find; regular patch fixes are available from the downloads...
  • SNAP

  • Referenced in 166 articles [sw04184]
  • graphs, calculates structural properties, generates regular and random graphs, and supports attributes on nodes...
  • GraphBase

  • Referenced in 135 articles [sw01555]
  • great variety of properties. Some of the graphs are based on data from the “real ... based on regular mathematical constructions such as lattices and quaternions. Graphs can be modified...
  • sage-drg

  • Referenced in 5 articles [sw26413]
  • computation to prove nonexistence of distance-regular graphs. A package for the Sage computer algebra ... given intersection array for a distance-regular graph. We use this tool to show that ... there is no distance-regular graph with intersection array...
  • GraphGrep

  • Referenced in 11 articles [sw18891]
  • interface to GraphGrep is a regular expression graph query language Glide that combines features from...
  • qTorch

  • Referenced in 5 articles [sw27767]
  • problem on 3- through 7-regular graphs using the quantum approximate optimization algorithm (QAOA), successfully ... when simulating Max-Cut/QAOA with graphs of regularities approximately five and below. Insight into ... stochastic contraction method outperforms the line graph based method only when the time to calculate...
  • nSPARQL

  • Referenced in 13 articles [sw11895]
  • have been largely recognized as fundamental for graph database query languages. This fact has motivated ... argued in a previous paper that nested regular expressions are appropriate to navigate RDF data ... query language for RDF, that uses nested regular expressions as building blocks. In this paper ... evaluation of a nested regular expression E over an RDF graph G can be computed...
  • GraphLog

  • Referenced in 32 articles [sw20098]
  • graph patterns. Edges in queries represent edges or paths in the database. Regular expressions...
  • QUIC

  • Referenced in 32 articles [sw11795]
  • sparse inverse covariance estimation. The ℓ 1 -regularized Gaussian maximum likelihood estimator (MLE) has been ... inverse covariance matrix, or alternatively the underlying graph structure of a Gaussian Markov Random Field ... resulting optimization problem which is a regularized log-determinant program. In contrast to recent state...
  • GenerateUHG

  • Referenced in 5 articles [sw26974]
  • removal and its contraction yield hamiltonian graphs. We also verify up to order ... Sheehan that there is no 4-regular 1H graph. Extending work of Schwenk, we describe...
  • GRADPART

  • Referenced in 2 articles [sw37003]
  • generation. It computes all isomorphism-types of graphs with a given degree-sequence by recursively ... vertices of maximal degree ( until regular graphs are reached ), and gluing the pieces together...
  • RGCNN

  • Referenced in 1 article [sw36662]
  • RGCNN: Regularized Graph CNN for Point Cloud Segmentation. Point cloud, an efficient 3D object representation ... learning works often convert point clouds to regular 3D voxel grids or collections of images ... this paper, we instead propose a regularized graph convolutional neural network (RGCNN) that directly consumes ... deploy a graph-signal smoothness prior in the loss function, thus regularizing the learning process...
  • Myhill-Nerode

  • Referenced in 11 articles [sw28547]
  • regular expressions. There are numerous textbooks on regular languages. Many of them focus on finite ... automata are graphs, matrices or functions, none of which are inductive datatypes. Regular expressions...
  • Kleene Algebra

  • Referenced in 8 articles [sw32203]
  • given monoid, (regular) languages, sets of paths in a graph, sets of computation traces, binary...
  • SHELL2

  • Referenced in 8 articles [sw16623]
  • propagator-type one- and two-loop Feynman graphs with external lines corresponding to massive ... massless particles on-shell is presented. Dimensional regularization to regularize both ultraviolet and infrared divergences...
  • Fullerene

  • Referenced in 9 articles [sw15046]
  • package for constructing and analyzing structures of regular fullerenes. Fullerene (Version 4.4) is a general ... generate any fullerene isomer, perform topological and graph theoretical analysis, as well as calculate...
  • LaSVM

  • Referenced in 3 articles [sw12120]
  • show in the graph, LASVM requires considerably less memory than a regular SVM solver. This...
  • WORHP

  • Referenced in 17 articles [sw10824]
  • required, but some smoothness and regularity assumptions are necessary for the underlying theory ... routines for computing sparse derivatives by applying graph-coloring methods to finite differences, structure-preserving...
  • DoQO

  • Referenced in 1 article [sw08906]
  • Diagonalisation of quantum observables on regular lattices and general graphs. In the study of quantum...