• Graph Theory

  • Referenced in 4 articles [sw28581]
  • graphs, supporting (labelled) multi-edges and infinite graphs. A polymorphic edge type allows edges...
  • NLambda

  • Referenced in 5 articles [sw23172]
  • definable structures, such as the countably infinite clique graph or the set of all intervals ... article: ’SMT Solving for Functional Programming over Infinite Structures...
  • GADAR

  • Referenced in 2 articles [sw03266]
  • inefficient. GADAR (short for “Graphs with Algebraically Defined Adjacency Relations”) is a package based ... applied to investigation of the infinite families of graphs...
  • InfoMod

  • Referenced in 1 article [sw21234]
  • their classes in terms of certain infinite planar graphs (dessins) called c{c}arks. InfoMod...
  • Kleene Algebra

  • Referenced in 7 articles [sw32203]
  • finite iteration and an omega operation for infinite iteration. We show that powersets over ... regular) languages, sets of paths in a graph, sets of computation traces, binary relations...
  • damage_throttling

  • Referenced in 1 article [sw39526]
  • number of vertices damaged in the graph. To this end, we formalize the definition ... less than the cop throttling number. Infinite families of examples and non-examples of tightness ... given. We also find an infinite family of connected graphs G of order...
  • CGV

  • Referenced in 3 articles [sw19315]
  • main graph canvas interactions are augmented with several visual cues, among which the infinite grid ... browser. CGV has been used to evaluate graph clustering results, to navigate topological structures...
  • PICASSO

  • Referenced in 1 article [sw36776]
  • graph rewriting systems that generalize Petri nets and subsume a diverse range of infinite-state...
  • Fwtree

  • Referenced in 1 article [sw21201]
  • finite p-group, functions to investigate the graph of all finite p-groups ... library of finite quotients of certain infinite pro-p-groups of finite rank, width...
  • LOU

  • Referenced in 3 articles [sw11650]
  • enumerate the common parse words for several infinite families of tree pairs and discuss several ... equivalent to the statement that every planar graph is four-colorable, so the results...
  • GBDD

  • Referenced in 1 article [sw15451]
  • framework for unified verification of infinite-state systems based on automata theory. It represents states ... other kinds of structures such as graphs. For an introduction to Regular Model Checking...
  • ANSYS

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

  • Referenced in 283 articles [sw00060]
  • ACL2 is both a programming language in which...
  • BARON

  • Referenced in 339 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • Coq

  • Referenced in 1856 articles [sw00161]
  • Coq is a formal proof management system. It...
  • COSTA

  • Referenced in 23 articles [sw00162]
  • COSTA is a research prototype which performs automatic...
  • CSDP

  • Referenced in 202 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • C-XSC 2.0

  • Referenced in 127 articles [sw00182]
  • A C++ class library for extended scientific computing...
  • GAP

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

  • Referenced in 690 articles [sw00366]
  • Gmsh is a 3D finite element grid generator...