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

BGL
 Referenced in 57 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...

Traces
 Referenced in 99 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...

plantri
 Referenced in 57 articles
[sw10864]
 Fast generation of planar graphs. The program Plantri is described. Its principles of operation ... isomorphismfree 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...

pcalg
 Referenced in 74 articles
[sw06072]
 estimation of the equivalence class of a Directed Acyclic Graph (DAG) via the PCAlgorithm ... equivalence class is represented by its (unique) Completete Partially Directed Acyclic Graph (CPDAG). Furthermore...

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...

House of Graphs
 Referenced in 33 articles
[sw06693]
 next to complete lists of some graph classesalso a list of special graphs that...

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

ILUT
 Referenced in 135 articles
[sw08734]
 each fillin 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...

WebGraph
 Referenced in 40 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...

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

SDPpack
 Referenced in 51 articles
[sw04333]
 computing provably good approximations to NPhard graph problems in polynomial time. Semidefinite programs ... best solved by interiorpoint methods, the class of methods introduced by Karmarkar...

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

tSNE
 Referenced in 74 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...

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...

Biq Mac
 Referenced in 65 articles
[sw10532]
 other approaches. In particular, for dense graphs, where linear programmingbased methods fail, our method ... structure, we can solve even larger problem classes. We could prove optimality for several problems...

SgpViz
 Referenced in 6 articles
[sw07631]
 finite semigroups through their 𝒟classes or Cayley graphs, as well as to make friendlier...

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

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...