Pages that link to "Item:Q3512458"

The following pages link to An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458):

Displaying 8 items.

• A note on \(L (2, 1)\)-labelling of trees (Q511194) (← links)
• Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
• \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
• On the complexity of labeled oriented trees (Q968053) (← links)
• (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
• The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees (Q2364083) (← links)
• A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q2830211) (← links)