Online promise problems with online width metrics (Q859981): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q247180
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Rodney G. Downey / rank
 
Normal rank
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.jcss.2006.08.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020138610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / 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: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domino Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some packing problem related to dynamic storage allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring inductive graphs on-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linearity of First-Fit Coloring of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring interval graphs with First-Fit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linkage of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line graph coloring algorithm with sublinear performance ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms finding tree-decompositions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank

Latest revision as of 11:49, 25 June 2024

scientific article
Language Label Description Also known as
English
Online promise problems with online width metrics
scientific article

    Statements

    Online promise problems with online width metrics (English)
    0 references
    0 references
    0 references
    22 January 2007
    0 references
    parameterized complexity
    0 references
    online algorithms
    0 references
    online coloring
    0 references
    pathwidth
    0 references
    treewidth
    0 references
    persistence
    0 references

    Identifiers