Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984307728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating resource allocation and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-phase algorithms for throughput maximization for real-time scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-coloring of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:57, 2 July 2024

scientific article
Language Label Description Also known as
English
Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs
scientific article

    Statements

    Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (English)
    0 references
    16 June 2010
    0 references
    0 references
    approximation algorithms
    0 references
    chordal graphs
    0 references
    coloring
    0 references
    interval graphs
    0 references
    0 references