Tight Lower Bounds for the Complexity of Multicoloring (Q5111704): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Tight Lower Bounds for the Complexity of Multicoloring
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ESA.2017.18 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1607.03432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On r-Simple k-Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Lower Bounds for the Complexity of Multicoloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Multi-Coloring with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Results Concerning Multicoloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mastermind / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Graph Homomorphism and Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3586724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional colorings with large denominators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for graph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal reconstruction of graphs under the additive model / 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: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicoloring trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment and multicolouring of the induced subgraphs of the triangular lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming based algorithms for set multicover and multiset multicover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicoloring and Mycielski construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Combinatorial Problem in Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment and weighted coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technique for multicoloring triangle-free hexagonal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New plain-exponential time classes for graph homomorphism / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4391089961 / rank
 
Normal rank
Property / title
 
Tight Lower Bounds for the Complexity of Multicoloring (English)
Property / title: Tight Lower Bounds for the Complexity of Multicoloring (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ESA.2017.18 / rank
 
Normal rank

Latest revision as of 15:58, 30 December 2024

scientific article; zbMATH DE number 7204996
Language Label Description Also known as
English
Tight Lower Bounds for the Complexity of Multicoloring
scientific article; zbMATH DE number 7204996

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    27 May 2020
    0 references
    multicoloring
    0 references
    Kneser graph
    0 references
    homomorphism
    0 references
    ETH lower bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Tight Lower Bounds for the Complexity of Multicoloring (English)
    0 references

    Identifiers

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