• Algorithm 447

  • Referenced in 145 articles [sw12877]
  • Algorithm 447: effcient algorithms for graph manipulation. Efficient algorithms are presented for partitioning a graph ... simple paths. The algorithm for partitioning of a graph into simple paths of iterative ... number of edges, each algorithm requires time and space proportional to max (V, E) when...
  • LEDA

  • Referenced in 261 articles [sw00509]
  • computer science areas -- data structures, graph and network algorithms, and computational geometry -- LEDA...
  • Chaco

  • Referenced in 117 articles [sw09640]
  • have developed a variety of algorithms for graph partitioning and implemented them into a package...
  • gSpan

  • Referenced in 110 articles [sw11908]
  • datasets and propose a novel algorithm called gSpan (graph-based substructure pattern mining), which discovers ... lexicographic order among graphs, and maps each graph to a unique minimum DFS code ... study shows that gSpan substantially outperforms previous algorithms, sometimes by an order of magnitude...
  • BGL

  • Referenced in 61 articles [sw17557]
  • utmost importance to encourage reuse of graph algorithms and data structures. Part of the Boost ... graph library that implements this interface will be interoperable with the BGL generic algorithms ... other algorithms that also use this interface. The BGL provides some general purpose graph classes...
  • ParMETIS

  • Referenced in 132 articles [sw04697]
  • that implements a variety of algorithms for partitioning unstructured graphs, meshes, and for computing fill ... algorithms implemented in ParMETIS are based on the parallel multilevel k-way graph-partitioning, adaptive...
  • METIS

  • Referenced in 452 articles [sw04089]
  • graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms...
  • Traces

  • Referenced in 154 articles [sw07823]
  • automorphism group of a graph is investigated. A new algorithmic design aimed at reducing ... making computation feasible for several classes of graphs which are hard for all the main...
  • WebGraph

  • Referenced in 51 articles [sw30097]
  • which are particularly suitable for storing web graphs (or, in general, integers with power ... provide a detailed mathematical analysis. Algorithms for compressing web graphs that exploit gap compression ... speed and compression ratio. Algorithms for accessing a compressed graph without actually decompressing it, using ... actually necessary. Algorithms for analysing very large graphs, such as HyperBall, which has been used...
  • OGDF

  • Referenced in 32 articles [sw04102]
  • from practice, and practical evaluation of graph drawing algorithms is essential. However, graph drawing ... consuming. Obviously, graph drawing libraries can ease the implementation of new algorithms ... covers a wide range of graph drawing algorithms. However, the lack of publicly available source ... library provides: A wide range of graph drawing algorithms that allow to reuse and replace...
  • PT-Scotch

  • Referenced in 58 articles [sw07038]
  • large graphs is a difficult problem, because on the one hand minimum degree algorithms ... orderings with the nested dissection algorithm requires efficient graph bipartitioning heuristics, the best sequential implementations ... algorithms, implemented in the PT-Scotch software package, which allows one to order large graphs ... state-of-the-art sequential algorithms. Our implementation uses the classical nested dissection approach...
  • pcalg

  • Referenced in 85 articles [sw06072]
  • Directed Acyclic Graph (DAG) via the PC-Algorithm. The equivalence class is represented ... unique) Completete Partially Directed Acyclic Graph (CPDAG). Furthermore, a PAG instead of a CPDAG ... Functions for causal inference using the IDA algorithm (based on do-calculus of Judea Pearl...
  • MAXFLOW

  • Referenced in 131 articles [sw13223]
  • mincut/maxflow in a graph. This software library implements the maxflow algorithm described in ”An Experimental...
  • Scotch

  • Referenced in 79 articles [sw07818]
  • package devoted to graph mapping, based on the Dual Recursive Bipartitioning algorithm. Predefined mapping strategies ... graph, whether they are connected or not. We give brief descriptions of the algorithm...
  • Graphs

  • Referenced in 106 articles [sw12277]
  • presented with a network (graph). A so-called preprocessing algorithm may compute certain information ... this survey, we review selected approaches, algorithms, and results on shortest-path queries from these ... query time. We survey methods for general graphs as well as specialized methods for restricted...
  • MCODE

  • Referenced in 48 articles [sw35748]
  • This paper describes a novel graph theoretic clustering algorithm, ”Molecular Complex Detection” (MCODE), that detects ... given parameters. The algorithm has the advantage over other graph clustering methods of having ... which correspond to known protein complexes. The algorithm is not affected by a known high...
  • Reduze

  • Referenced in 76 articles [sw10354]
  • employing a variant of Laporta’s reduction algorithm. This web page presents version ... load balancing job system. Fast graph and matroid based algorithms allow for the identification...
  • CGAL

  • Referenced in 372 articles [sw00118]
  • data structures. All these data structures and algorithms operate on geometric objects like points ... libraries Qt, Geomview, and the Boost Graph Library...
  • MaxCliqueDyn

  • Referenced in 35 articles [sw08507]
  • fast exact algorithm for finding a maximum clique in an undirected graph described ... vertices in a given graph. Maximum clique algorithms differ from maximal clique algorithms (e.g., Bron ... graph (cliques that cannot be enlarged), while the maximum clique algorithms find a maximum clique...