• NuMVC

  • Referenced in 11 articles [sw08219]
  • time-consuming. Secondly, although using edge weighting techniques to diversify the search, these algorithms lack ... strategies: two-stage exchange and edge weighting with forgetting. The two-stage exchange strategy selects ... stages. The strategy of edge weighting with forgetting not only increases weights of uncovered edges ... also decreases some weights for each edge periodically. These two strategies are used in designing...
  • SA-cluster

  • Referenced in 8 articles [sw06867]
  • clustering refinement, the graph edge weights are iteratively adjusted to balance the relative importance between ... distances which are affected by the edge weight update. In order to improve the efficiency ... random walk distances given the edge weight increments. Complexity analysis is provided to estimate...
  • Inc-cluster

  • Referenced in 4 articles [sw06866]
  • clustering refinement, the graph edge weights are iteratively adjusted to balance the relative importance between ... distances which are affected by the edge weight update. In order to improve the efficiency ... random walk distances given the edge weight increments. Complexity analysis is provided to estimate...
  • gergm

  • Referenced in 3 articles [sw21317]
  • networks that arise in nature with weighted edges. Such networks are routinely dichotomized ... simulate and model the edges of a weighted graph. The GERGM specifies a joint distribution ... family of graphs with continuous-valued edge weights. However, current estimation algorithms for the GERGM...
  • MicroGrid

  • Referenced in 11 articles [sw09654]
  • partitioner, and a range of edge and node weighting schemes exploiting a range of static...
  • MARNA

  • Referenced in 5 articles [sw35539]
  • these sequence–structure alignments, libraries of weighted alignment edges are generated. The weights reflect...
  • GTSP-LIB

  • Referenced in 4 articles [sw25565]
  • GTSP, a complete directed graph with edge weights is given as input along with...
  • minet

  • Referenced in 7 articles [sw08432]
  • dependencies between genes and the weight of an edge quantifies the statistical evidence...
  • HEWN

  • Referenced in 3 articles [sw02189]
  • complexity for CLIQUE problem. A Hierarchical Edge-Weighted Network (HEWN) which is equivalent ... arrangement of vertices is hierarchical and each edge is attached by a guiding matrix that...
  • gSkeletonClu

  • Referenced in 3 articles [sw30861]
  • parameter ε lie in the edge weights of the corresponding CCMST. By means of tree...
  • GraphWeb

  • Referenced in 2 articles [sw20147]
  • biological networks that: analyses directed and undirected, weighted and unweighted heterogeneous networks of genes, proteins ... edges based on dataset support, edge weight and node annotation; detects gene modules from networks...
  • RRW

  • Referenced in 2 articles [sw31389]
  • implicitly makes use of network topology, edge weights, and long range interactions between proteins...
  • FlipCut

  • Referenced in 2 articles [sw08374]
  • then extend our approach by using edge weights to weight the columns of the 0/1/?-matrix....
  • Biomine

  • Referenced in 2 articles [sw28409]
  • disease associations and gene ontology annotations. Edges are weighted based on their type, reliability ... parameter optimization procedure where different edge types are weighted to optimize link prediction accuracy...
  • BDDCML

  • Referenced in 38 articles [sw13395]
  • solver include implementation of the adaptively generated weighted averages on faces on each level, robust ... averages among subdomains on all faces and edges...
  • grapherator

  • Referenced in 1 article [sw29255]
  • functions for step-wise generation of (weighted) graphs. Aimed for research in the field ... optimization. Graphs are generated adding nodes, edges and weights. Each step may be repeated multiple ... graph topology and structure of edge weights...
  • PairViz

  • Referenced in 3 articles [sw11038]
  • problem to one of constructing edge-traversals of (possibly weighted) graphs. 𝙿𝚊𝚒𝚛𝚅𝚒𝚣 implements various edge...
  • 2D triangulations

  • Referenced in 36 articles [sw11159]
  • triangulations are also provided for sets of weighted points. Delaunay and regular triangulations offer nearest ... force some constrained segments to appear as edges of the triangulation. Several versions of constrained...
  • FAUST

  • Referenced in 1 article [sw02343]
  • nodes and interatomic distances as edge weights. Node colors are based on chemical identities...
  • TRANSWESD

  • Referenced in 1 article [sw17199]
  • Transitive reduction is one approach for eliminating edges reflecting indirect effects ... elaborated variant of TRANSitive reduction for WEighted Signed Digraphs that overcomes conceptual problems of existing ... perturbation experiments; (ii) the use of edge weights (association strengths) for recognizing true redundant structures...