scientific article; zbMATH DE number 1302184
From MaRDI portal
Publication:4247451
zbMath0944.05050MaRDI QIDQ4247451
Jue Xue, Panos M. Pardalos, Thelma D. Mavridou
Publication date: 24 September 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations ⋮ Circular coloring of graphs via linear programming and tabu search ⋮ A coloring fuzzy graph approach for image classification ⋮ An exact algorithm for the partition coloring problem ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ Solving graph coloring problems with the Douglas-Rachford algorithm ⋮ Discrete dynamical system approaches for Boolean polynomial optimization ⋮ A Wide Branching Strategy for the Graph Coloring Problem ⋮ On the complexity of path problems in properly colored directed graphs ⋮ Exploring the role of graph spectra in graph coloring algorithm performance ⋮ New results on the robust coloring problem ⋮ Spectral bounds for the quantum chromatic number of quantum graphs ⋮ The graph coloring problem: A neuronal network approach ⋮ Computing the Chromatic Number Using Graph Decompositions via Matrix Rank ⋮ Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks ⋮ About equivalent interval colorings of weighted graphs ⋮ Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments ⋮ Mining market data: a network approach ⋮ The robust coloring problem. ⋮ An incremental search heuristic for coloring vertices of a graph ⋮ Computing the chromatic number using graph decompositions via matrix rank
This page was built for publication:
