On the Tractability of (K, I)-Coloring

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-74180-2_16
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

On Tractability of Path Integration

Journal of Mathematical Physics
Nonlinear PhysicsMathematical PhysicsStatistical
1996English

Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
1998English

On the Tractability of Digraph-Based Task Models

2011English

An Exact Parallel Algorithm for the Radio K-Coloring Problem

2019English

Coloring Random and Semi-Random K-Colorable Graphs

Journal of Algorithms
1995English

On the Tractability of Public Persuasion With No Externalities

2020English

On the Simultaneous Edge-Coloring Conjecture

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2000English

On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

On the Max-Weight Edge Coloring Problem

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy