
Magma
 Referenced in 2747 articles
[sw00540]
 Computer algebra system (CAS). Magma is a large, wellsupported software package designed for computations ... groups, rings, fields, modules, algebras, schemes, curves, graphs, designs, codes and many others. Magma also...

PTScotch
 Referenced in 50 articles
[sw07038]
 graph ordering. The parallel ordering of large graphs is a difficult problem, because ... with the nested dissection algorithm requires efficient graph bipartitioning heuristics, the best sequential implementations ... package, which allows one to order large graphs in parallel, yielding orderings the quality ... several novel features to solve the parallel graph bipartitioning problem. Thanks to these improvements...

WebGraph
 Referenced in 42 articles
[sw30097]
 provides simple ways to manage very large graphs, exploiting modern compression techniques. More precisely ... actually necessary. Algorithms for analysing very large graphs, such as HyperBall, which has been used ... with various settings. Datasets for very large graph (e.g., a billion of links). These ... access and analyse very large web graphs. Using WebGraph is as easy as installing...

GraphBase
 Referenced in 118 articles
[sw01555]
 algorithms. The programs generate a large number of graphs with a great variety of properties...

SNAP
 Referenced in 35 articles
[sw04184]
 system for analysis and manipulation of large networks. Graphs consists of nodes and directed/undirected/multiple edges ... optimized for maximum performance and compact graph representation. It easily scales to massive networks with ... billions of edges. It efficiently manipulates large graphs, calculates structural properties, generates regular and random ... nodes and edges. Besides scalability to large graphs, an additional strength of SNAP is that...

Pregel
 Referenced in 27 articles
[sw13416]
 Pregel: a system for largescale graph ... processing. Many practical computing problems concern large graphs. Standard examples include the Web graph ... that of its outgoing edges or mutate graph topology. This vertexcentric approach is flexible ... result is a framework for processing large graphs that is expressive and easy to program...

SVMlight
 Referenced in 259 articles
[sw04076]
 this version includes an algorithm for training largescale transductive SVMs. The algorithm proceeds ... Nearest Neighbor is the Spectral Graph Transducer. SVMlight can also train SVMs with cost models ... code has been used on a large range of problems, including text classification [Joachims, 1999c...

GraphScope
 Referenced in 22 articles
[sw20427]
 GraphScope: Parameterfree Mining of Large Timeevolving Graphs. How can we find communities ... discontinuity timepoints in such streams of graphs, in an online, anytime fashion ... designed to operate on large graphs, in a streaming fashion. We demonstrate the efficiency...

SparseMatrix
 Referenced in 600 articles
[sw04629]
 University of Florida Sparse Matrix Collection, a large and actively growing set of sparse matrices ... statistics, power networks, and other networks and graphs). We provide software for accessing and managing...

GENREG
 Referenced in 46 articles
[sw26671]
 article an efficient algorithm to generate regular graphs with a given number of vertices ... implementation allows computing even large classes of graphs, like construction of the 4regular graphs...

ParMETIS
 Referenced in 121 articles
[sw04697]
 variety of algorithms for partitioning unstructured graphs, meshes, and for computing fillreducing orderings ... especially suited for parallel AMR computations and large scale numerical simulations. The algorithms implemented ... based on the parallel multilevel kway graphpartitioning, adaptive repartitioning, and parallel multiconstrained...

InterViewer
 Referenced in 28 articles
[sw00443]
 complicated, nonplanar graph with a large number of edge crossings and because...

ANF
 Referenced in 14 articles
[sw12276]
 some of our results from mining large graphs using...

TALE
 Referenced in 7 articles
[sw13844]
 TALE: A Tool for Approximate Large Graph Matching. Large graph datasets are common in many ... many modern applications need to query large graphs, each of which has hundreds to thousands ... novel technique for approximate matching of large graph queries. We propose a novel indexing method ... innovative matching paradigm to query large graphs. This technique distinguishes nodes by their importance...

EXTRACOL
 Referenced in 9 articles
[sw06552]
 Coloring large graphs based on independent set extraction We present an effective approach ({ssf EXTRACOL ... coloring large graphs. The proposed approach uses a preprocessing method to extract large independent sets...

KronFit
 Referenced in 36 articles
[sw20428]
 algorithm for fitting the Kronecker graph generation model to large real networks. A naive approach ... techniques. Experiments on a wide range of large real and synthetic networks show that KRONFIT ... network structure, and the resulting synthetic graphs can be used for nullmodels, anonymization, extrapolations...

CFinder
 Referenced in 19 articles
[sw12379]
 user to easily navigate between the original graph and the web of these groups ... efficient for locating the cliques of large sparse graphs. Availability: CFinder (for Windows, Linux...

SAcluster
 Referenced in 7 articles
[sw06867]
 analyzing and visualizing large networks. The goal of graph clustering ... partition vertices in a large graph into clusters based on various criteria such as vertex ... Many existing graph clustering methods mainly focus on the topological structures, but largely ignore ... significant speedup over SACluster on large graphs, while achieving exactly the same clustering quality...

GRIP
 Referenced in 10 articles
[sw12696]
 system is designed for drawing large graphs and uses a novel multidimensional forcedirected...

SING
 Referenced in 5 articles
[sw18904]
 because their filtering power degrades on large graphs. Results: In this paper, SING (Subgraph search ... indexing system able to cope with large graphs, is presented. The method uses the notion ... time over databases of medium and large graphs. Other specific tests show that the proposed ... system is effective for single large graphs...