• SparseMatrix

  • Referenced in 725 articles [sw04629]
  • development and performance evaluation of sparse matrix algorithms. It allows for robust and repeatable experiments ... geometry (as structural engineering, computational fluid dynamics, model reduction, electromagnetics, semiconductor devices, thermodynamics, materials, acoustics ... statistics, power networks, and other networks and graphs). We provide software for accessing and managing...
  • Algorithm 447

  • Referenced in 163 articles [sw12877]
  • simple paths. The algorithm for partitioning of a graph into simple paths of iterative ... paths. (The start vertex can be specified dynamically.) If V is the number of vertices ... number of edges, each algorithm requires time and space proportional to max (V, E) when...
  • STAPL

  • Referenced in 15 articles [sw00910]
  • particle transport calculations, molecular dynamics, geometric modeling, and graph algorithms. STAPL provides several different algorithms ... results obtained using STAPL for a molecular dynamics code and a particle transport code...
  • Colibri

  • Referenced in 9 articles [sw12043]
  • dynamic graphs. Low-rank approximations of the adjacency matrix of a graph are essential ... graph evolves over time, efficiently and within limited storage. Real graphs typically have thousands ... with these challenges. Our version for static graphs, Colibri-S, iteratively finds a non-redundant ... propose an efficient update algorithm for dynamic, time-evolving graphs, Colibri-D. Our evaluation...
  • GeneScout

  • Referenced in 7 articles [sw31815]
  • paths in the graph G. A dynamic programming algorithm is used to find the optimal...
  • COCONUT

  • Referenced in 40 articles [sw04760]
  • graphs are implemented using the VGTL (Vienna Graph Template Library), and the search database ... VDBL (Vienna DataBaseLibrary). Support for dynamic linking relieves the user from recompilation when modules ... parallel computing as wel! l. The solution algorithm is an advanced branch-and-bound scheme ... which proceeds by working on the search graph, a directed acyclic graph (DAG) of search...
  • DynGEM

  • Referenced in 4 articles [sw40461]
  • static graphs. However, many graphs in practical applications are dynamic and evolve constantly over time ... Naively applying existing embedding algorithms to each snapshot of dynamic graphs independently usually leads ... efficient algorithm DynGEM based on recent advances in deep autoencoders for graph embeddings, to address ... over time, (2) it can handle growing dynamic graphs, and (3) it has better running...
  • DDD

  • Referenced in 5 articles [sw12824]
  • Dynamic Graph Parallelisation Library. The parallel implementation of algorithms based on dynamic data structures...
  • GADS

  • Referenced in 1 article [sw20519]
  • GADS - Graph Algorithms for Dynamical Systems. GADS is a toolbox of graph algorithms ... analysis of dynamical systems. It is based on the tools GAIO and PARTY ... construct a discretized graph of the system. The graph algorithms of GADS and also from ... describe the key characteristics of the dynamical system. For further information, in particular...
  • EoN

  • Referenced in 6 articles [sw31396]
  • Gillespie simulation; allows weighted graphs; allows non-Markovian dynamics; Gillespie algorithms for Markovian dynamics; Through...
  • InterViewer

  • Referenced in 29 articles [sw00443]
  • InterViewer: Dynamic visualization of protein-protein interactions From the perspective of graph drawing, a protein ... graph with a large number of edge crossings and because it is a disconnected graph ... faster than other recent implementations of drawing algorithms; (2) it can be used not only...
  • ACODYGRA

  • Referenced in 1 article [sw02715]
  • ACODYGRA: An agent algorithm for coloring dynamic graphs...
  • CATBox

  • Referenced in 4 articles [sw18663]
  • into subroutines. The graph, and additional auxiliary graphs like residual networks, are displayed and provide ... algorithms and their complexity. Computer exercises and examples replace the usual static pictures of algorithm ... dynamics...
  • DPvis

  • Referenced in 7 articles [sw00219]
  • dependency (interaction) graph. DPvis is also able to generate animations showing the dynamic change ... implementing a simple variant of the DPLL algorithm on its own, DPvis also features...
  • TrajGraph

  • Referenced in 3 articles [sw38749]
  • urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive...
  • RECFMM

  • Referenced in 6 articles [sw21760]
  • particular, which provides graph-theoretic optimal scheduling in adaptation to the dynamics in parallel execution ... employed. RECFMM supports multiple algorithm variants that mark the major advances with low-frequency interaction...
  • INDDGO

  • Referenced in 2 articles [sw23104]
  • solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework...
  • Conley-Morse-Database

  • Referenced in 3 articles [sw30144]
  • dynamical system Grids, Strong Components; Computing “Clutching” graphs for adjacent parameters Tree-based Grid algorithms...
  • 2D Apollonius Graphs

  • Referenced in 1 article [sw11155]
  • Apollonius graph in two dimensions. The Apollonius graph is the dual of the Apollonius diagram ... Voronoi diagram for points. The algorithms provided are dynamic...
  • BH

  • Referenced in 5 articles [sw17762]
  • algorithm’ ’any’ ’atomic’ ’bimap’ ’bind’ ’circular_buffer’ ’concept’ ’config’ ’container’ ’date’_’time’ ’detail’ ’dynamic_bitset ... exception’ ’filesystem’ ’flyweight’ ’foreach’ ’functional’ ’fusion’ ’geometry’ ’graph’ ’heap’ ’icl’ ’integer’ ’interprocess’ ’intrusive’ ’io’ ’iostreams...