On-line algorithms for 2-coloring hypergraphs via chip games

DOI10.1016/0304-3975(93)90025-OzbMath0768.68115MaRDI QIDQ1210300

Javed A. Aslam, Aditi Dhagat

Publication date: 24 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

boundshypergraphs2-coloringchip gameson-line 2-coloring algorithm

Mathematics Subject Classification ID

Hypergraphs (05C65) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Chip games and paintability ⋮ Drifting games and Brownian motion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive snoopy caching
• On 3-chromatic hypergraphs
• On a Combinatorial Problem of Erdös and Hajnal
• Ein kombinatorisches Problem von P. Erdős und A. Hajnal
• On a property of families of sets
• On a combinatorial game

This page was built for publication: On-line algorithms for 2-coloring hypergraphs via chip games