Channel assignment on graphs of bounded treewidth (Q1417576): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(03)00236-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144688537 / rank
 
Normal rank

Latest revision as of 11:53, 30 July 2024

scientific article
Language Label Description Also known as
English
Channel assignment on graphs of bounded treewidth
scientific article

    Statements

    Channel assignment on graphs of bounded treewidth (English)
    0 references
    5 January 2004
    0 references
    Channel assignment
    0 references
    Bounded treewidth
    0 references
    Graph colouring
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers