Probabilistic graph-coloring in bipartite and split graphs
DOI10.1007/S10878-007-9112-2zbMATH Open1206.05039OpenAlexW2070627531MaRDI QIDQ732320FDOQ732320
Authors: Nicolas Bourgeois, F. Della Croce, Bruno Escoffier, C. Murat, Vangelis Th. Paschos 
Publication date: 9 October 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/2110
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for combinatorial problems
- Differential approximation algorithms for some combinatorial optimization problems
- Approximation results for the minimum graph coloring problem
- \(z\)-approximations
- Probabilistic a priori routing-location problems
- Traveling Salesman Facility Location Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Priori Optimization
- The probabilistic minimum spanning tree problem
- The Probabilistic Minimum Vertex-covering Problem
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Title not available (Why is that?)
- Node-weighted graphs having the König-Egerváry property
- Title not available (Why is that?)
- Scheduling with incompatible jobs
- On Approximate Solutions for Combinatorial Optimization Problems
- Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
- On the probabilistic minimum coloring and minimum \(k\)-coloring
- Shortest path problems with node failures
- The probabilistic longest path problem
- A priori optimization for the probabilistic maximum independent set problem
Cited In (8)
- Vertex-Uncertainty in Graph-Problems
- A survey on combinatorial optimization in dynamic environments
- Clique partitioning with value-monotone submodular cost
- Clique partitioning of interval graphs with submodular costs on the cliques
- The probabilistic minimum coloring problem (extended abstract)
- The probabilistic minimum dominating set problem
- On the probabilistic minimum coloring and minimum \(k\)-coloring
- On the probabilistic min spanning tree problem
This page was built for publication: Probabilistic graph-coloring in bipartite and split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732320)
