• GrabCut

  • Referenced in 109 articles [sw15842]
  • GrabCut: interactive foreground extraction using iterated graph cuts. The problem of efficient, interactive foreground/background segmentation ... Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast ... Recently, an approach based on optimization by graph-cut has been developed which successfully combines ... information. In this paper we extend the graph-cut approach in three respects. First...
  • Krylstat

  • Referenced in 17 articles [sw13558]
  • same methods with the addition of graph colouring...
  • CsegGraph

  • Referenced in 7 articles [sw00170]
  • CsegGraph: a graph colouring instance generator. The implementation of a graph generator associated with ... mathematical derivatives is described. The graph colouring instances are obtained as intersection graphs ... graph instances satisfy χ(G(A))≡χ(G Π m (A)). A summary of colouring ... show that the main idea of the graph instance generator can be extended to general...
  • SATLIB Benchmark Suite

  • Referenced in 3 articles [sw11916]
  • encoded combinatorial problems such as Graph Colouring; and individual SAT-encoded instances from various domains...
  • sgcp-via-cliques

  • Referenced in 2 articles [sw34590]
  • cliques: Solving the (Weighted) Selective Graph Colouring Problem via Maximum Cliques...
  • MOLGEN

  • Referenced in 26 articles [sw00586]
  • groups operating on sets, new methods for colouring orbits and determining automorphism groups are presented ... combinatorial considerations and allows to construct molecular graphs with given properties of considerable size...
  • GraphCombEx

  • Referenced in 0 articles [sw32090]
  • problems currently supported include maximum clique, graph colouring, maximum independent set, minimum vertex clique covering...
  • TopoColour

  • Referenced in 1 article [sw21496]
  • TopoColour uses graph theory to colour polygon layers. Furthermore it can save the adjacency...
  • HepMC

  • Referenced in 10 articles [sw18252]
  • with each vertex, flow patterns (such as colour) can be stored and traced, random number ... vertices are stored separately in a graph structure, reflecting the evolution of a physics event...
  • Mathematical Components

  • Referenced in 4 articles [sw30935]
  • structures like lists, prime numbers or finite graphs, to advanced topics in algebra. The repository ... formal proof of the Four Colour Theorem (Appel - Haken, 1976) and a mechanization...
  • COSTA

  • Referenced in 23 articles [sw00162]
  • COSTA is a research prototype which performs automatic...
  • GAP

  • Referenced in 3003 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • Macaulay2

  • Referenced in 1776 articles [sw00537]
  • Macaulay2 is a software system devoted to supporting...
  • Magma

  • Referenced in 3055 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...
  • Maple

  • Referenced in 5220 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

  • Referenced in 6129 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 12721 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • nauty

  • Referenced in 579 articles [sw00611]
  • graph-theoretic program NAUTY: nauty is a program...
  • polymake

  • Referenced in 308 articles [sw00724]
  • polymake is open source software for research in...