• UnitWalk

  • Referenced in 36 articles [sw00993]
  • many common benchmarks ranging from graph coloring problems to microprocessor verification. Our algorithm is inspired...
  • ColPack

  • Referenced in 32 articles [sw07045]
  • ColPack: Software for graph coloring and related problems in scientific computing. ColPack is a package...
  • Localizer

  • Referenced in 21 articles [sw21238]
  • papers. Experimental results on Boolean satisfiability graph coloring, graph partitioning, and job-shop scheduling show...
  • NoMoRe

  • Referenced in 22 articles [sw07094]
  • computing a-colorings (non-standard graph colorings with two colors) of the block graph ... given program $P$. Intuitively, an a-coloring reflects the set of generating rules ... have included an interface to the graph drawing tool DaVinci for visualization of block graphs...
  • WORHP

  • Referenced in 20 articles [sw10824]
  • computing sparse derivatives by applying graph-coloring methods to finite differences, structure-preserving sparse named...
  • AmgX

  • Referenced in 14 articles [sw13440]
  • preconditioners often rely on parallel graph coloring algorithms. The AMG algorithm implemented in the AmgX...
  • EXTRACOL

  • Referenced in 10 articles [sw06552]
  • Coloring large graphs based on independent set extraction We present an effective approach ({ssf EXTRACOL ... coloring large graphs. The proposed approach uses a preprocessing method to extract large independent sets ... memetic algorithm to color the residual graph. Each preprocessing application identifies, with a dedicated tabu...
  • COCO2P

  • Referenced in 11 articles [sw25779]
  • package COCO2P for the computation with colored graphs, and in particular for the computation with...
  • DSATUR

  • Referenced in 8 articles [sw03004]
  • given approximate coloring algorithm a graph is said to be slightly hard-to-color ... algorithm uses more colors than the chromatic number. Similarly, a graph is said ... smallest of such graphs for the DSATUR vertex coloring algorithm...
  • Gephi

  • Referenced in 66 articles [sw12110]
  • people that have to explore and understand graphs. Like Photoshop but for data, the user ... representation, manipulate the structures, shapes and colors to reveal hidden properties. The goal...
  • Tulip

  • Referenced in 15 articles [sw07464]
  • experiment tools such as clustering, graph drawing and metrics coloring for the purpose of information...
  • BBMCL

  • Referenced in 17 articles [sw11525]
  • tests. Selective coloring algorithms are fastest for a large subset of the graphs considered...
  • BHOSLIB

  • Referenced in 18 articles [sw08220]
  • Graph Problems (Maximum Clique, Maximum Independent Set, Minimum Vertex Cover and Vertex Coloring...
  • Rainbowfish

  • Referenced in 2 articles [sw33131]
  • Rainbowfish: a succinct colored de Bruijn graph representation. The colored de Bruijn graph --a variant ... VARI, a representation of the colored de Bruijn graph that adopts the BOSS representation ... representation of VARI allows the colored de Bruijn graph to be constructed and analyzed ... color information of the colored de Bruijn graph that reduces the space usage even further...
  • FrogCOL

  • Referenced in 2 articles [sw20461]
  • tree frogs, originally introduced for the graph-coloring problem, for its potential usefulness ... necessity of first producing a graph-coloring solution. Both algorithms are compared to a wide...
  • INCOP

  • Referenced in 2 articles [sw00441]
  • been encoded, including Constraint Satisfaction Problems, graph coloring, frequency assignment.\parINCOP is an open ... known benchmarks. The challenging flat300_28 graph coloring instance has been colored in 30 colors...
  • SMCramsey

  • Referenced in 3 articles [sw11440]
  • random variables that arise in Graph Colorings and Ramsey theory. It accompanies by the article...
  • CEACOL

  • Referenced in 1 article [sw07789]
  • extraction and expansion approach for graph coloring We present an extraction and expansion approach ... graph coloring problem. The extraction phase transforms a large graph into a sequence of progressively ... starts by generating an approximate coloring for the smallest graph in the sequence. Then ... determine a coloring for each intermediate graph. To color each graph, a simple perturbation based...
  • SE2COL

  • Referenced in 1 article [sw07790]
  • extraction and expansion approach for graph coloring We present an extraction and expansion approach ... graph coloring problem. The extraction phase transforms a large graph into a sequence of progressively ... starts by generating an approximate coloring for the smallest graph in the sequence. Then ... determine a coloring for each intermediate graph. To color each graph, a simple perturbation based...
  • E2COL

  • Referenced in 1 article [sw07791]
  • extraction and expansion approach for graph coloring We present an extraction and expansion approach ... graph coloring problem. The extraction phase transforms a large graph into a sequence of progressively ... starts by generating an approximate coloring for the smallest graph in the sequence. Then ... determine a coloring for each intermediate graph. To color each graph, a simple perturbation based...