• Zoltan

  • Referenced in 62 articles [sw07458]
  • Parallel partitioning with Zoltan: is hypergraph partitioning worth it? Graph partitioning is an important ... communication in parallel computing. Different models (graph, hypergraph) and objectives (edge cut, boundary vertices) have ... been proposed. Hypergraph partitioning has become increasingly popular over the last decade. Its main strength ... empirical study of the Zoltan parallel hypergraph and graph (PHG) partitioner on graphs from...
  • PaToH

  • Referenced in 39 articles [sw09873]
  • PaToH (Partitioning Tools for Hypergraph) is a Multilevel Hypergraph Partitioning tool that I developed during ... University (1994-1999). It was the fastest hypergraph partitioner when I wrote it, and probably ... Important features of PaToH: Fast, stable multilevel hypergraph partitioner, Hypergraph partitioning with fixed cells, Multi ... constraint hypergraph partitioner...
  • DiaGen

  • Referenced in 28 articles [sw10321]
  • diagram editor generator based on hypergraph transformation. Diagram editors which are tailored to a specific ... their combined advantages. Created editors use hypergraphs as an internal diagram model and hypergraph parsers ... syntax-directed editing is realized by programmed hypergraph transformation of these internal hypergraphs. This approach...
  • hMETIS

  • Referenced in 18 articles [sw11542]
  • programs for partitioning hypergraphs such as those corresponding to VLSI circuits. The algorithms implemented ... hMETIS are based on the multilevel hypergraph partitioning schemes developed in our lab. The advantages ... quality partitions! On a wide range of hypergraphs arising in the VLSI domain hMETIS produces...
  • GXL

  • Referenced in 18 articles [sw16479]
  • ordered graphs which are extended to represent hypergraphs and hierarchical graphs. This flexible data model...
  • FastFDs

  • Referenced in 11 articles [sw01613]
  • DFHD) search for finding minimal covers of hypergraphs. The technique of reducing the FD discovery ... problem of finding minimal covers of hypergraphs was applied previously by Lopes...
  • Parkway

  • Referenced in 7 articles [sw12863]
  • Parkway 2.0: A parallel multilevel hypergraph partitioning tool. We recently proposed a coarse-grained parallel ... multilevel algorithm for the k-way hypergraph partitioning problem. This paper presents a formal analysis ... comparison with state-of-the-art serial hypergraph partitioners. The isoefficiency function (and thus scalability ... backed up by empirical results on hypergraphs taken from the VLSI and performance modelling application...
  • KaHyPar

  • Referenced in 7 articles [sw20718]
  • KaHyPar - Karlsruhe Hypergraph Partitioning. KaHyPar is a multilevel hypergraph partitioning framework for optimizing ... three phases: In the coarsening phase, the hypergraph is coarsened to obtain a hierarchy ... smaller hypergraphs. After applying an initial partitioning algorithm to the smallest hypergraph in the second...
  • JUNG

  • Referenced in 11 articles [sw12112]
  • modal graphs, graphs with parallel edges, and hypergraphs. It provides a mechanism for annotating graphs...
  • CirCUs

  • Referenced in 9 articles [sw00128]
  • clauses are sorted by solving a hypergraph linear arrangement problem. Then they are clustered...
  • UMPa

  • Referenced in 5 articles [sw14123]
  • communication minimization We propose a directed hypergraph model and a refinement heuristic to distribute communicating...
  • Ligra

  • Referenced in 5 articles [sw32528]
  • provided in the inputs/ directory. Graph and hypergraph utilities are provided in the utils/ directory...
  • GraphLSH

  • Referenced in 2 articles [sw40698]
  • GraphLSHC: towards large scale spectral hypergraph clustering. Hypergraph is popularly used for describing multi-relationships ... communities. However, the traditional spectral clustering for hypergraph (HC) incurs expensive costs in terms ... scalability problem faced by the large scale hypergraph spectral clustering. In our solution, the hypergraph...
  • HiBISCuS

  • Referenced in 2 articles [sw36021]
  • HiBISCuS: Hypergraph-Based Source Selection for SPARQL Endpoint Federation. Efficient federated query processing ... attention. This work presents HiBISCuS, a novel hypergraph-based source selection approach to federated SPARQL...
  • hypershed

  • Referenced in 1 article [sw23313]
  • Watersheds on hypergraphs for data clustering. We present a novel extension of watershed cuts ... hypergraphs, allowing the clustering of data represented as an hypergraph, in the context of data ... nodes, but as edges of the hypergraph. The properties associated with each instance are used...
  • halp

  • Referenced in 1 article [sw21707]
  • halp: Hypergraph Algorithms Package. halp is a Python software package that provides both a directed ... undirected hypergraph implementation, as well as several important and canonical algorithms that operate on these ... hypergraphs. See http://murali-group.github.io/halp/ for documentation, code examples, and more information...
  • PFAST

  • Referenced in 2 articles [sw01457]
  • matrix, bipartite graph or hypergraph representation). The algorithms for facility layout primarily use the from...
  • ExactDensityBounder

  • Referenced in 2 articles [sw30925]
  • bound for Turan densities of 3-uniform hypergraphs. It creates an SDP problem to determine...
  • visualsc

  • Referenced in 1 article [sw31953]
  • Simplicial complex and hypergraph visualization: visualsc is a simple command-line tool similar to Graphviz ... designed for visualizing abstract simplicial complexes and hypergraphs. It is using a physics-like spring...
  • HBPS

  • Referenced in 1 article [sw08849]
  • algebraic word problems by using the software Hypergraph Based Problem Solver (HBPS). We show students...