Pages that link to "Item:Q837161"

The following pages link to An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161):

Displaying 15 items.

• Distance three labelings of trees (Q415278) (← links)
• New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
• \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
• Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks (Q691628) (← links)
• A complete \(L (2, 1)\) span characterization for small trees (Q896092) (← links)
• \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
• On the complexity of labeled oriented trees (Q968053) (← links)
• The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
• \(L(h,1,1)\)-labeling of outerplanar graphs (Q1014311) (← links)
• The \(L(2,1)\)-labeling of unigraphs (Q2275923) (← links)
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees (Q2364083) (← links)
• A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
• A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q2830211) (← links)
• On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs (Q5963630) (← links)
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)