• plantri

  • Referenced in 69 articles [sw10864]
  • Fast generation of planar graphs. The program Plantri is described. Its principles of operation ... free generator of many classes of planar graphs, including triangulations, quadrangulations and convex polytopes. Many ... many counts of isomorphism classes of planar graphs compiled using Plantri are given. These include...
  • Graphs

  • Referenced in 107 articles [sw12277]
  • with arguable practical significance such as planar graphs and complex networks...
  • PIGALE

  • Referenced in 29 articles [sw05435]
  • algorithm library essentially concerned with planar graphs. This software is particularly intended for graph theoretical...
  • Algorithm 797

  • Referenced in 5 articles [sw13176]
  • Fortran subroutines for approximate solution of graph planarization problems using GRASP. We describe Fortran subroutines ... maximum planar subgraph problem (graph planarization) using a Greedy Randomized Adaptive Search Procedure (GRASP...
  • LamanGraphs

  • Referenced in 11 articles [sw39185]
  • realizations of a Laman graph. Laman graphs model planar frameworks that are rigid ... isometries, to realize a Laman graph in the plane. Such realizations can be seen...
  • GenerateUHG

  • Referenced in 5 articles [sw26974]
  • show that there exist nearly cubic 1H graphs of order ... Bondy and Jackson that every planar 1H graph contains two vertices of degree 2, verify ... Cantoni’s conjecture that every planar cubic 3H graph contains a triangle, and show that ... there exists a planar cyclically 4-edge-connected cubic graph with exactly k hamiltonian cycles...
  • PlaNet

  • Referenced in 4 articles [sw00711]
  • minimum total length in a planar graph is 𝒩𝒫-hard, even if all terminals...
  • LOU

  • Referenced in 3 articles [sw11650]
  • equivalent to the statement that every planar graph is four-colorable, so the results...
  • ASPTools

  • Referenced in 3 articles [sw33089]
  • module in turn; planar: generate random planar graphs; redr: check the redundancy of individual rules...
  • Fullerene

  • Referenced in 9 articles [sw15046]
  • generate any fullerene isomer, perform topological and graph theoretical analysis, as well as calculate ... program creates symmetric planar drawings of the fullerene graph and generates accurate molecular 3D geometries...
  • R-CHIE

  • Referenced in 2 articles [sw17137]
  • given RNA secondary structure as a planar graph consisting of base-paired stems interconnected ... difficult or impossible to represent as planar stem-loop diagrams. Arc diagrams can intuitively display...
  • VRPBench

  • Referenced in 1 article [sw35956]
  • Vehicle Routing Problem (VRP) in a planar graph embedded in the Euclidean 2D space...
  • InfoMod

  • Referenced in 1 article [sw21234]
  • classes in terms of certain infinite planar graphs (dessins) called c{c}arks. InfoMod illustrates...
  • PseudoViewer3

  • Referenced in 6 articles [sw17134]
  • PseudoViewer3: generating planar drawings of large-scale RNA structures with pseudoknots. Motivation: Pseudoknots ... user to ensure that the structure graph is overlap-free. Many programs such ... shot rather than get a graph with overlaps to be edited. There are few programs ... known types of RNA pseudoknots as planar drawings, but visualizes some hypothetical pseudoknots...
  • VisiLibity

  • Referenced in 1 article [sw33404]
  • VisiLibity1 in planar polygonal environments with polygonal holes: visibility polygons; visibility graphs; Euclidean shortest paths...
  • Kaleido

  • Referenced in 8 articles [sw05940]
  • dimensional space has faces which are planar regular polygons (not necessarily convex), and finitely many ... computer generated drawings of the edge-graphs of the polyhedra and their duals (with...
  • bipartiteSUSY

  • Referenced in 1 article [sw19818]
  • calculations for physical theories based on bipartite graphs. In particular, the package can employ ... scattering amplitudes, including those for non-planar diagrams, with particular attention to computational speed ... Field Theories, which utilize the same bipartite graphs. Through the use of an interactive graphical...
  • tanglenum

  • Referenced in 1 article [sw34926]
  • planar Tangles by Douglas A. Torrance: A planar Tangle is a smooth simple closed curve ... enumerate Tangles by counting their dual graphs, which consist of a certain family of polysticks...
  • PlanarCurveExplorer

  • Referenced in 0 articles [sw05922]
  • This application allows the user to explore planar curves: (1) Specification by: parametric formula ... curve; evolute curve. (3) Display of curvature graph...
  • AGD

  • Referenced in 12 articles [sw00022]
  • AGD-Library: A Library of Algorithms for Graph...