Improved Inapproximability of Rainbow Coloring

doi 10.1137/1.9781611975994.90
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Inapproximability of Clustering in Lp Metrics

2019English

Improved Distributed Algorithms for Coloring Interval Graphs With Application to Multicoloring Trees

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2020English

Efficiency of a Pneumococcal Opsonophagocytic Killing Assay Improved by Multiplexing and by Coloring Colonies

Clinical Diagnostic Laboratory Immunology
2003English

Inapproximability of the Minimum Biclique Edge Partition Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2010English

Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Faster Deterministic Distributed Coloring Through Recursive List Coloring

2020English

Experiments With Parallel Graph Coloring Heuristics and Applications of Graph Coloring

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1996English

List Coloring Digraphs

Journal of Graph Theory
GeometryTopology
2017English

Acute Rapamycin Treatment Improved Glucose Tolerance Through Inhibition of Hepatic Gluconeogenesis in Rainbow Trout (Oncorhynchus Mykiss)

American Journal of Physiology - Regulatory Integrative and Comparative Physiology
Physiology
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy