• MIM

  • Referenced in 128 articles [sw26139]
  • that uses graphs to represent models. These graphs display the structure of dependencies, both associational ... Chapter 7 describes the use of directed graphs, chain graphs, and other graphs. Chapter...
  • RelView

  • Referenced in 101 articles [sw00798]
  • relations represented as Boolean matrices or directed graphs, especially for prototyping relational specifications and programs...
  • pcalg

  • Referenced in 85 articles [sw06072]
  • equivalence class of a Directed Acyclic Graph (DAG) via the PC-Algorithm. The equivalence class ... represented by its (unique) Completete Partially Directed Acyclic Graph (CPDAG). Furthermore, a PAG instead...
  • Zoltan

  • Referenced in 53 articles [sw07458]
  • 10th DIMACS implementation challenge and some directed (nonsymmetric) graphs. We show that hypergraph partitioning ... superior to graph partitioning on directed graphs (nonsymmetric matrices), where the communication volume is reduced...
  • COCONUT

  • Referenced in 38 articles [sw04760]
  • proceeds by working on the search graph, a directed acyclic graph (DAG) of search nodes...
  • CNTK

  • Referenced in 10 articles [sw21056]
  • series of computational steps via a directed graph. In this directed graph, leaf nodes represent...
  • Python Web Graph Generator

  • Referenced in 26 articles [sw05789]
  • generator. It can generate a synthetic Web graph of about one million nodes ... desktop machine. It supports both directed and undirected graphs. It implements a threaded variant...
  • DAGMan

  • Referenced in 10 articles [sw08433]
  • DAGMan (Directed Acyclic Graph Manager) is a meta-scheduler for HTCondor. It manages dependencies between ... level than the HTCondor Scheduler. A directed acyclic graph (DAG) can be used to represent ... programs are nodes (vertices) in the graph, and the edges (arcs) identify the dependencies. HTCondor ... programs (jobs) based on dependencies. The Directed Acyclic Graph Manager (DAGMan) is a meta-scheduler...
  • MCODE

  • Referenced in 47 articles [sw35748]
  • advantage over other graph clustering methods of having a directed mode that allows fine-tuning...
  • GXL

  • Referenced in 18 articles [sw16479]
  • based standard exchange format for reengineering. GXL (Graph eXchange Language) is an XML-based standard ... tools. Formally, GXL represents typed, attributed, directed, ordered graphs which are extended to represent hypergraphs...
  • IPSep-CoLa

  • Referenced in 9 articles [sw09789]
  • extend the popular force-directed approach to network (or graph) layout to allow separation constraints ... specific layout requirements, including: layout of directed graphs to better show flow; layout with ... graphs with grouped nodes (called clusters). In the stress majorization force-directed layout process, separation...
  • TGFF

  • Referenced in 15 articles [sw17689]
  • standard way of generating pseudo-random task-graphs for use in scheduling and allocation research ... instances consisting of partially-ordered or directed acyclic graphs (DAGs) of tasks, i.e., task-graphs...
  • Benchmarking

  • Referenced in 23 articles [sw14630]
  • input based, output based, hyperbolic graph, additive, super, and directional efficiency). Peers and slacks ... mergers is also supported. Methods for graphing the technology sets are also included. There...
  • CONTEST

  • Referenced in 19 articles [sw12738]
  • many challenging matrix computational tasks. Several random graph models have been proposed that capture ... models. The models produce unweighted directed or undirected graphs; that is, symmetric or unsymmetric matrices...
  • Gpd

  • Referenced in 8 articles [sw08651]
  • graph of groups is a directed graph with a group at each vertex and with...
  • Gabow SCC

  • Referenced in 8 articles [sw28915]
  • strongly connected components of a directed graph. Using data refinement techniques, we extract efficient code...
  • Kavosh

  • Referenced in 8 articles [sw29733]
  • size sub-graphs of a given graph (directed or undirected). We evaluated our algorithm...
  • ILUT

  • Referenced in 157 articles [sw08734]
  • each fill-in element using only the graph of the matrix. Then each fill ... techniques derived from modifications of a given direct solver by including a dropoff rule, based...
  • DAGuE

  • Referenced in 12 articles [sw20709]
  • consider can be expressed as a Direct Acyclic Graph of tasks with labeled edges designating...
  • cantata

  • Referenced in 7 articles [sw13031]
  • visual program is described as a directed graph, where each node represents an operator...