This repository contains online supplementary materials for the work: "A Numerically Exact Branch-and-Price Algorithm with Accelerated Column Enumeration and Decision Diagrams for the Graph Coloring ...
#define _(blk) std::cerr << #blk << " "; start_ = clock(); blk \ std::cerr << (clock()-start_)*1.0/CLOCKS_PER_SEC << "s" << std::endl; "simple_maximal_planar_random ...
Abstract: Coloring for random graph from G(n,1/2) is a classic example exhibiting an Information v. Computation gap: it has chromatic number of Theta(n/log n) w.p. 1-o(1) while the best efficiently ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback