• Zoltan

  • Referenced in 57 articles [sw07458]
  • significant benefit on undirected graphs (symmetric matrices) using current parallel software tools...
  • CRYPTIM

  • Referenced in 28 articles [sw02442]
  • CRYPTIM: Graphs as tools for symmetric encryption. A combinatorial method of encryption is presented ... idea is to treat vertices of a graph as messages and walks of a certain...
  • CONTEST

  • Referenced in 20 articles [sw12738]
  • produce unweighted directed or undirected graphs; that is, symmetric or unsymmetric matrices with elements equal...
  • SymNMF

  • Referenced in 15 articles [sw12668]
  • study an extended formulation for graph clustering called Symmetric NMF (SymNMF). In contrast ... similarity matrix as an input, and a symmetric nonnegative lower rank approximation is computed ... spectral clustering, justify SymNMF as a general graph clustering method, and discuss the strengths...
  • Saucy

  • Referenced in 7 articles [sw13867]
  • tasks they solve, and use general-purpose graph symmetry tools to uncover this symmetry. Common ... limited use on very large, sparse, symmetric graphs. Over the last 10+ years, we developed...
  • LAMG

  • Referenced in 34 articles [sw06551]
  • graph Laplacian linear solver. Laplacian matrices of graphs arise in large-scale computational applications such ... symmetric linear system $Ax=b$ is presented, where $A$ is a graph Laplacian. LAMG...
  • SDPpack

  • Referenced in 51 articles [sw04333]
  • programs to the space of block diagonal, symmetric, positive semidefinite matrices. Applications arise in many ... computing provably good approximations to NP-hard graph problems in polynomial time. Semidefinite programs...
  • Fullerene

  • Referenced in 9 articles [sw15046]
  • generate any fullerene isomer, perform topological and graph theoretical analysis, as well as calculate ... properties. The program creates symmetric planar drawings of the fullerene graph and generates accurate molecular...
  • PSPIKE

  • Referenced in 16 articles [sw07072]
  • Unsymmetric, or symmetric systems, real, parallel on distributed-memory clusters, combinatorial graph algorithms...
  • CSF

  • Referenced in 1 article [sw34943]
  • will compute the chromatic symmetric function (CSF) for any graph with specified vertex and edge...
  • nonexistent_ties

  • Referenced in 1 article [sw34438]
  • this paper, we develop the augmented graph stability method, which allows for explicitly connecting ... transformation of a directed network into a symmetrized-and-augmented undirected network is the central ... transformation is executed by symmetrizing and weighting the underlying connection graph and adding new undirected...
  • L-GRAAL

  • Referenced in 3 articles [sw34161]
  • common sub-graphs between the networks, as measured by edge-correctness and symmetric sub-structures...
  • XPABLO

  • Referenced in 4 articles [sw08733]
  • Extensions of Certain Graph-based Algorithms for Preconditioning. The original TPABLO algorithms are a collection ... algorithms which compute a symmetric permutation of a linear system such that the permuted system...
  • BootCMatch

  • Referenced in 8 articles [sw27182]
  • software package for bootstrap AMG based on graph weighted matching. This article has two main ... presented is meant to handle general symmetric and positive definite (SPD) sparse linear systems, without ... maximum weight matching in the adjacency graph of the system matrix. More specifically, a maximum...
  • TAUCS

  • Referenced in 32 articles [sw04014]
  • tree-structured matrices. All of these are symmetric orderings. Matrix Operations. Matrix-vector multiplication, triangular ... Schur complement elements iteratively. Multilevel-Support-Graph Preconditioners. Similar to domain-decomposition preconditioners. Includes...
  • BioGAP

  • Referenced in 4 articles [sw08793]
  • such as the word distance in Cayley graphs, stabilizer subgroups for modelling biological constraints, using ... involved in this research are well-studied (symmetric, hyperoctahedral), but the generating sets are derived...
  • MTGL

  • Referenced in 1 article [sw04181]
  • MultiThreaded Graph Library (MTGL) is a collection of algorithms and data structures designed ... with support from the Qthreads library, on Symmetric Multiprocessor (SMP) machines or multi-core workstations ... modeled after the Boost Graph Library, though the internals differ in order to leverage shared...
  • TRACE

  • Referenced in 2 articles [sw06654]
  • spatial grids, especially on clusters of symmetric multiprocessors (SMPs). This paper presents a method ... processors that combines 2 load balancing methodologies, graph partitioning and graph matching, to achieve maximum...
  • GRECS

  • Referenced in 2 articles [sw23226]
  • disclosure systems. We propose GRECS (stands for GRaph EnCryption for approximate Shortest distance queries) which ... first construction makes use of only symmetric-key operations, resulting in a computationally-efficient construction ... efficient and can be applied to graphs that scale up to 1.6 million nodes...
  • Crocodile

  • Referenced in 3 articles [sw09769]
  • have a compact, readable and structured specification. Symmetric Nets with Bags (SNB) were introduced ... proof of concept for experimenting the quotient graph techniques together with hierarchical set decision diagrams...