• GRAPH

  • Referenced in 23 articles [sw19079]
  • eigenvalue bounded by $-2$. Integral graphs. Graph angles. Star complements. Graphs sharing specified properties with...
  • RDF123

  • Referenced in 3 articles [sw26493]
  • tools typically map only to star-shaped RDF graphs, i.e. each spreadsheet...
  • SCL

  • Referenced in 1 article [sw04206]
  • star complement library) is covered by the version 2 of the GNU General Public Licence ... module for calculating the maximal graphs using so-called star complement technique. Also, there ... computing the maximal clique of a given graph, and for computing the isomorphism classes...
  • Stone Kleene

  • Referenced in 1 article [sw28599]
  • describe reachability in weighted graphs. Many properties of the Kleene star arise as a special ... star of a matrix. We prove numerous results useful for reasoning about weighted graphs...
  • ODEA

  • Referenced in 3 articles [sw07671]
  • graph, we also investigate an alternative featuring so-called star flows. The main part...
  • COStar

  • Referenced in 1 article [sw28651]
  • this article, we introduce COStar, a D-star Lite-based dynamic search algorithm for codon ... directed acyclic graph using a sliding window approach. Then, the D-star Lite algorithm ... target site in the resulting graph. Optimizing a gene is thus converted to a search...
  • Kleene Algebra

  • Referenced in 7 articles [sw32203]
  • expand them by axiomatisations of the Kleene star for finite iteration and an omega operation ... regular) languages, sets of paths in a graph, sets of computation traces, binary relations...
  • gergm

  • Referenced in 4 articles [sw21317]
  • thereby significantly extending the family of weighted graphs that can be modeled with the GERGM ... model specifications from the well-studied two-stars model. A working R version...
  • STR

  • Referenced in 3 articles [sw32183]
  • method of uniqueness. We present STR (Star-Triangle Relations), a Mathematica package designed to solve ... some pedagogical examples of computation of Feynman graphs as the scalar two-loop kite master...
  • MiSTree

  • Referenced in 1 article [sw30562]
  • Trees. The minimum spanning tree (MST), a graph constructed from a distribution of points, draws ... astronomy (to detect mass segregation in star clusters) and cosmology (to search for filaments ... initially using a k-nearest neighbour graph (kNN, rather than a matrix of pairwise distances...
  • ADOL-C

  • Referenced in 239 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...
  • ANSYS

  • Referenced in 662 articles [sw00044]
  • ANSYS offers a comprehensive software suite that spans...
  • AUTOMATE

  • Referenced in 12 articles [sw00059]
  • AUTOMATE, a computing package for automata and finite...
  • CGAL

  • Referenced in 360 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • CoCoA

  • Referenced in 631 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • GAP

  • Referenced in 2876 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • Macaulay2

  • Referenced in 1692 articles [sw00537]
  • Macaulay2 is a software system devoted to supporting...
  • Magma

  • Referenced in 2917 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...
  • Maple

  • Referenced in 5124 articles [sw00545]
  • The result of over 30 years of cutting...