Incremental list coloring of graphs, parameterized by conservation (Q391091): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Precoloring extension. I: Interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with incompatible jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring the complexity boundary between coloring and list-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice classes of parametrized tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Clustering and Dynamic Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for certain parameterized NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some colorful problems parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search: is brute-force avoidable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental List Coloring of Graphs, Parameterized by Conservation / 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: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized coloring for tree-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized coloring problems on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring extension on unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching the \(k\)-change neighborhood for TSP is W[1]-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the compatibility between a graph and a simple order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal cost reconfiguration of data placement in a storage area network / rank
 
Normal rank

Latest revision as of 04:43, 7 July 2024

scientific article
Language Label Description Also known as
English
Incremental list coloring of graphs, parameterized by conservation
scientific article

    Statements

    Incremental list coloring of graphs, parameterized by conservation (English)
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    parameterized complexity
    0 references
    data reduction
    0 references
    problem kernel
    0 references
    local search
    0 references
    incremental clustering
    0 references
    precoloring extension
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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