Hardness and algorithms for rainbow connection (Q491198): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W2150438015 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0809.2493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Hypergraph Partitioning and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank

Latest revision as of 16:05, 10 July 2024

scientific article
Language Label Description Also known as
English
Hardness and algorithms for rainbow connection
scientific article

    Statements

    Hardness and algorithms for rainbow connection (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 August 2015
    0 references
    connectivity
    0 references
    rainbow coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references