Work

Approximate hypergraph coloring

Year: 1996

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-61422-2_119

Authors: Pierre Kelsen, Sanjeev Mahajan, Hariharan Ramesh

Institutions: Max Planck Society, Max Planck Institute for Informatics

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W173395504

FWCI:

Cites: 5

Cited by:

Related to: 10