• Graphs

  • Referenced in 102 articles [sw12277]
  • well as specialized methods for restricted graph classes, in particular for those classes with arguable...
  • BGL

  • Referenced in 52 articles [sw17557]
  • provides some general purpose graph classes that conform to this interface, but they ... meant to be the “only” graph classes; there certainly will be other graph classes that ... formulation of this interface. The BGL graph interface and graph components are generic...
  • plantri

  • Referenced in 50 articles [sw10864]
  • Fast generation of planar graphs. The program Plantri is described. Its principles of operation ... isomorphism-free generator of many classes of planar graphs, including triangulations, quadrangulations and convex polytopes ... addition, many counts of isomorphism classes of planar graphs compiled using Plantri are given. These ... quadrangulations, convex polytopes, several classes of cubic and quartic graphs and triangulations of disks...
  • Traces

  • Referenced in 76 articles [sw07823]
  • labeling and the automorphism group of a graph is investigated. A new algorithmic design aimed ... thereby making computation feasible for several classes of graphs which are hard...
  • pcalg

  • Referenced in 66 articles [sw06072]
  • estimation of the equivalence class of a Directed Acyclic Graph (DAG) via the PC-Algorithm ... equivalence class is represented by its (unique) Completete Partially Directed Acyclic Graph (CPDAG). Furthermore...
  • GENREG

  • Referenced in 42 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 4-regular graphs...
  • COCONUT

  • Referenced in 38 articles [sw04760]
  • internal representation of various matrix classes. The graphs are implemented using the VGTL (Vienna Graph...
  • House of Graphs

  • Referenced in 26 articles [sw06693]
  • next to complete lists of some graph classes-also a list of special graphs that...
  • ILUT

  • Referenced in 124 articles [sw08734]
  • each fill-in element using only the graph of the matrix. Then each fill ... fill exceeds a certain threshold. The second class of methods consists of techniques derived from...
  • CaGe

  • Referenced in 17 articles [sw21206]
  • Environment for Studying Some Special Classes of Plane Graphs. CaGe is an Open Source software...
  • WebGraph

  • Referenced in 34 articles [sw30097]
  • actually necessary. Algorithms for analysing very large graphs, such as HyperBall, which has been used ... also provide several classes tha modify (e.g., transpose) or recompress a graph, so to experiment...
  • SDPpack

  • Referenced in 51 articles [sw04333]
  • computing provably good approximations to NP-hard graph problems in polynomial time. Semidefinite programs ... best solved by interior-point methods, the class of methods introduced by Karmarkar...
  • Anchor-PROMPT

  • Referenced in 8 articles [sw09802]
  • AnchorPROMPT treats an ontology as a graph with classes as nodes and slots as links...
  • Grappa

  • Referenced in 5 articles [sw10517]
  • Java. The package comprises classes that implement graph representation, presentation and layout services. It provides ... need to visualize information in terms of graphs, such as process flows, business workflows ... built. Through subclassing, the classes that implement an application inherit graph drawing and layout services...
  • newGRAPH

  • Referenced in 2 articles [sw18738]
  • class of maximal reflexive θ-graphs generated by Smith graphs. A simple graph is said ... maximal graphs within a given class. Bicyclic graphs whose two cycles have a common path ... maximal reflexive θ-graphs in this class of graphs. The author uses programming package newGRAPH...
  • t-SNE

  • Referenced in 44 articles [sw22300]
  • manifolds, such as images ofobjects from multiple classes seen from multiple viewpoints. For visualizing ... random walks on neighborhood graphs to allow the implicit structure of all of the data...
  • geng

  • Referenced in 2 articles [sw26976]
  • outperforms the competitors for many difficult graph classes. Detailed comparisons against saucy, Bliss and conauto...
  • Biq Mac

  • Referenced in 54 articles [sw10532]
  • other approaches. In particular, for dense graphs, where linear programming-based methods fail, our method ... structure, we can solve even larger problem classes. We could prove optimality for several problems...
  • graphtheory

  • Referenced in 1 article [sw28148]
  • defined together with several classes implementing this interface. Graph nodes can be any hashable Python ... edges are instances of the Edge class. Graphs are instances of the Graph class (several...
  • NautyGraphs

  • Referenced in 1 article [sw27122]
  • graphs stored as instances of the class Graph. (See Comparison of Graph6 and Sparse6 formats ... graphs to instances of the class Graph for further work. The theoretical underpinnings of nauty...