• KaHIP

  • Referenced in 13 articles [sw19376]
  • Moreover, specialized techniques are included to partition road networks (Buffoon), to output a vertex separator ... techniques geared towards efficient partitioning of social networks...
  • JOSTLE

  • Referenced in 35 articles [sw04985]
  • extremely fast and provides high quality multilevel partitioning and diffusive load-balancing in both serial ... available under the name of NetWorks...
  • IsoRank

  • Referenced in 12 articles [sw08324]
  • every pair of input networks and then using k-partite matching to extract the final ... first known global alignment of PPI networks from five species: yeast, fly, worm, mouse...
  • Chapar

  • Referenced in 3 articles [sw22667]
  • face of site crashes and network partitions. Theoretical results state that causal consistency...
  • APOGEE

  • Referenced in 35 articles [sw08451]
  • extended pooling problems via linear and logarithmic partitioning schemes. Our recent work globally optimized ... problems: a generalized pooling problem treating the network topology as a decision variable...
  • HyperFlow

  • Referenced in 2 articles [sw38843]
  • plane requests. HyperFlow is resilient to network partitioning and component failures. It also enables interconnecting...
  • RDyn

  • Referenced in 1 article [sw28444]
  • provide an understanding of the dynamics of network formation and evolution; as a direct consequence ... synthesizing graphs having controlled topology and planted partitions has been often identified as a strategy ... novel algorithms aimed at identifying mutable network partitions we introduce RDyn, an approach able ... generates dynamic networks along with time-dependent ground-truth partitions having tunable quality...
  • SA-cluster

  • Referenced in 9 articles [sw06867]
  • visualizing large networks. The goal of graph clustering is to partition vertices in a large...
  • CBSSD

  • Referenced in 1 article [sw36497]
  • knowledge discovery from complex networks. Arbitrary network partitions are used as input for a subgroup...
  • MIN3P

  • Referenced in 9 articles [sw11519]
  • respect to the definition of the reaction network. Advective-diffusive transport in the water phase ... partitioning between phases, oxidation-reduction, ion exchange, and surface complexation. The reaction network is designed...
  • ARACNe-AP

  • Referenced in 3 articles [sw34267]
  • ARACNe-AP: gene network reverse engineering through adaptive partitioning inference of mutual information. The accurate ... Algorithm for the Reconstruction of Accurate Cellular Networks (ARACNe) represents one of the most effective ... algorithm, based on an Adaptive Partitioning strategy (AP) for estimating the Mutual Information ... preserving the Mutual Information estimator and the Network inference accuracy of the original algorithm. Given...
  • SCLaP

  • Referenced in 1 article [sw20060]
  • Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering. The most commonly used method ... tackle the graph partitioning problem in practice is the multilevel metaheuristic. In this paper ... refinement phase of multilevel graph partitioning. We mainly target networks with highly irregular and hierarchically ... clustered structure (but other network types can be partitioned as well). Additionally, we augment...
  • DeepGraph

  • Referenced in 2 articles [sw21965]
  • provides methods to construct, partition and plot networks, to interface with popular network packages...
  • LibDAI

  • Referenced in 15 articles [sw06422]
  • variables. libDAI supports directed graphical models (Bayesian networks) as well as undirected ones (Markov random ... graphs). It offers various approximations of the partition sum, marginal probability distributions and maximum probability...
  • G+Smo

  • Referenced in 39 articles [sw14372]
  • ease of use. The library is partitioned into smaller entities, called modules. Examples of available ... been developed within the homonym researc h network supported by the Austrian Science Fund...
  • FEADS

  • Referenced in 1 article [sw01347]
  • inherently parallel nature of network processing applications. However, partitioning and scheduling of application tasks ... full performance potential of a given network processor. The large variety of processor architectures ... increasing complexity of network applications further aggravate the problem. This work proposes a novel framework ... automating the task of application partitioning and scheduling for network processors. FEADS uses the simulated...
  • Map Generator

  • Referenced in 1 article [sw21224]
  • applet, the map generator clusters the network based on the map equation and generates ... here and C++ source code to partition large networks with millions of weighted directed links...
  • Inc-cluster

  • Referenced in 5 articles [sw06866]
  • visualizing large networks. The goal of graph clustering is to partition vertices in a large...
  • ERODE

  • Referenced in 5 articles [sw20210]
  • coarsest equivalence that refines a given initial partition. In the special case of ODEs with ... networks (CRNs) and continuous time Markov chains (CTMCs), it implements a more efficient partition-refinement...
  • RAMAS

  • Referenced in 12 articles [sw10958]
  • vertices of all rectangles in the partition and finding the roots of a finite ... find important applications in analysis of biological networks and robot control...