Vertex coloring of a graph for memory constrained scenarios
From MaRDI portal
Publication:2183733
DOI10.1007/s11786-019-00409-4zbMath1455.68148OpenAlexW2973445334WikidataQ127225979 ScholiaQ127225979MaRDI QIDQ2183733
Helio Pedrini, Eduardo Sant'Ana da Silva
Publication date: 27 May 2020
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-019-00409-4
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex coloring of graphs with few obstructions
- A framework for scalable greedy coloring on distributed-memory parallel computers
- Enumerating maximal independent sets with applications to graph colouring.
- A fast parallel coloring of planar graphs with five colors
- A note on the complexity of the chromatic number problem
- Spectrum graph coloring and applications to Wi-Fi channel assignment
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices
- NP-completeness of a family of graph-colouring problems
- Uncertain vertex coloring problem
- Local antimagic vertex coloring of a graph
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Online Graph Coloring Against a Randomized Adversary
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- The greedy coloring is a bad probabilistic algorithm
- Finding a Maximum Independent Set
- New methods to color the vertices of a graph
- A Parallel Graph Coloring Heuristic
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Sur le coloriage des graphs
- Dynamic graph coloring
- The smallest hard-to-color graph for algorithm DSATUR
