Channel assignment on graphs of bounded treewidth (Q1417576): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 13:33, 6 June 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