Perfect circular arc coloring (Q2569164): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s10878-005-1411-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079098713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of totally balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Color Claw-Free Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for circular arc colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Lexical Orderings of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(0(n^{1.5})\) algorithm to color proper circular arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(qn) algorithm to q-color a proper family of circular arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring a Family of Circular Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Tucker's Algorithm to Color Circular Arc Graphs / rank
 
Normal rank

Latest revision as of 17:38, 10 June 2024

scientific article
Language Label Description Also known as
English
Perfect circular arc coloring
scientific article

    Statements

    Perfect circular arc coloring (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2005
    0 references
    0 references
    graph coloring
    0 references
    circular-arc graph
    0 references
    perfect graph
    0 references
    matching
    0 references
    complexity
    0 references
    0 references