Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.dam.2008.06.013 / rank | |||
Property / author | |||
Property / author: Dominique de Werra / rank | |||
Property / author | |||
Property / author: Marc Demange / rank | |||
Property / author | |||
Property / author: Bruno Escoffier / rank | |||
Property / author | |||
Property / author: Jérôme Monnot / rank | |||
Property / author | |||
Property / author: Vangelis Th. Paschos / rank | |||
Property / author | |||
Property / author: Dominique de Werra / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Marc Demange / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Bruno Escoffier / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Jérôme Monnot / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Vangelis Th. Paschos / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.06.013 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2163111788 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling with incompatible jobs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4371290 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4414490 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Time slot scheduling of compatible jobs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weighted coloring: further complexity and approximability results / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms and Computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Max Coloring Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Batch processing with interval graph compatibilities between tasks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4093489 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A coloring problem for weighted graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The maximum saving partition problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Difference graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4838466 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Precoloring Extension III: Classes of Perfect Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4838453 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Planar Formulae and Their Uses / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP‐completeness of list coloring and precoloring extension on the edges of planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5501309 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3221403 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DAM.2008.06.013 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:48, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Weighted coloring on planar, bipartite and split graphs: Complexity and approximation |
scientific article |
Statements
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (English)
0 references
30 June 2009
0 references
graph coloring
0 references
weighted node coloring
0 references
weighted edge coloring
0 references
approximability
0 references
NP-completeness
0 references
planar graphs
0 references
bipartite graphs
0 references
split graphs
0 references
0 references