Topological additive numbering of directed acyclic graphs (Q477623): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C78 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6378654 / rank
 
Normal rank
Property / zbMATH Keywords
 
additive coloring
Property / zbMATH Keywords: additive coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
lucky labeling
Property / zbMATH Keywords: lucky labeling / rank
 
Normal rank
Property / zbMATH Keywords
 
directed acyclic graphs
Property / zbMATH Keywords: directed acyclic graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
topological additive numbering
Property / zbMATH Keywords: topological additive numbering / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052876314 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1310.4141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of lucky number of planar graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing problems in acyclic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lucky labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:03, 9 July 2024

scientific article
Language Label Description Also known as
English
Topological additive numbering of directed acyclic graphs
scientific article

    Statements

    Topological additive numbering of directed acyclic graphs (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    additive coloring
    0 references
    lucky labeling
    0 references
    directed acyclic graphs
    0 references
    topological additive numbering
    0 references
    computational complexity
    0 references

    Identifiers

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