The \(S\)-\textsc{labeling} problem: an algorithmic tour (Q1647835): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Single Machine Job Sequencing with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lambert \(w\) function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of the S-Labeling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the S-Labeling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arrangement problem parameterized above guaranteed value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping the genome / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of (0, 1)-matrices / rank
 
Normal rank

Latest revision as of 00:30, 16 July 2024

scientific article
Language Label Description Also known as
English
The \(S\)-\textsc{labeling} problem: an algorithmic tour
scientific article

    Statements

    The \(S\)-\textsc{labeling} problem: an algorithmic tour (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2018
    0 references
    algorithm
    0 references
    graph labeling
    0 references

    Identifiers