An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W171866752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for  -Colorings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(d,1)\)-labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L(2,1)\)-labelling of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:28, 28 June 2024

scientific article
Language Label Description Also known as
English
An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
scientific article

    Statements

    An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 July 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    frequency/channel assignment
    0 references
    graph algorithm
    0 references
    \(L(2, 1)\)-labeling
    0 references
    vertex coloring
    0 references
    0 references