scientific article; zbMATH DE number 1833421

zbMATH Open0998.68231MaRDI QIDQ4780802FDOQ4780802

Authors: Sriram Pemmaraju 

Publication date: 21 November 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2129/21290285

Title of this publication is not available (Why is that?)

Recommendations

• Equitable colorings extend Chernoff-Hoeffding bounds
• scientific article; zbMATH DE number 6452992
• scientific article; zbMATH DE number 437558
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• \(t\)-wise independence with local dependencies

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Coloring of graphs and hypergraphs (05C15)

Cited In (34)

• Equitable coloring of some convex polytope graphs
• Title not available (Why is that?)
• On equitable \(\Delta\)-coloring of graphs with low average degree
• A polyhedral approach for the equitable coloring problem
• \(t\)-wise independence with local dependencies
• Title not available (Why is that?)
• Equitable colorings of Kronecker products of graphs
• Title not available (Why is that?)
• Linear classifiers are nearly optimal when hidden variables have diverse effects
• Derandomizing local distributed algorithms under bandwidth restrictions
• Equitable colorings extend Chernoff-Hoeffding bounds
• Ore-type versions of Brooks' theorem
• Total equitable list coloring
• Equitable coloring of random graphs
• Improving lower bounds for equitable chromatic number
• Improved distributed approximations for maximum independent set
• Proportional choosability of complete bipartite graphs
• A note on the equitable choosability of complete bipartite graphs
• On list equitable total colorings of the generalized theta graph
• An Ore-type theorem on equitable coloring
• New global optima results for the Kauffman \(NK\) model: Handling dependency
• A DSATUR-based algorithm for the equitable coloring problem
• Proportional choosability: a new list analogue of equitable coloring
• The Randomized Coloring Procedure with Symmetry-Breaking
• Equitable colorings of Cartesian products of graphs
• Equitable defective coloring of sparse planar graphs
• The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
• A Tabu Search Heuristic for the Equitable Coloring Problem
• Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
• Proportional 2-choosability with a bounded palette
• A simple characterization of proportionally 2-choosable graphs
• A refinement of a result of Corrádi and Hajnal
• On the equitable choosability of the disjoint union of stars
• Equitable and list equitable colorings of planar graphs without 4-cycles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780802)