An exact algorithm for the channel assignment problem (Q1764816): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57601547, #quickstatements; #temporary_batch_1712201099914
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4252729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem about the Channel Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the chromatic number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the span in channel assignment problems: Bounds, computing and counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment on graphs of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arrangements, channel assignments, and associated polynomials / rank
 
Normal rank

Revision as of 17:40, 7 June 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for the channel assignment problem
scientific article

    Statements

    Identifiers

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