On-Line Algorithms for 2-Coloring Hypergraphs via Chip Games

doi 10.21236/ada230200
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Defense Technical Information Center

Related search

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs

SIAM Journal on Discrete Mathematics
Mathematics
2018English

Adapted List Coloring of Graphs and Hypergraphs

SIAM Journal on Discrete Mathematics
Mathematics
2008English

Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

New Approximation Algorithms for Graph Coloring

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1994English

ChIP-Chip: Algorithms for Calling Binding Sites

Methods in Molecular Biology
GeneticsMolecular Biology
2009English

Automatically Generated Algorithms for the Vertex Coloring Problem

PLoS ONE
Multidisciplinary
2013English

Displaying Image Neighborhood Hypergraphs Line-Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Algorithms for Stochastic Parity Games

2005English

Off-Line and On-Line Algorithms for Closed String Factorization

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy