Recommendations
- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
- Efficient dominating sets in labeled rooted oriented trees
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
- Optimal labellings of rooted directed trees
- A REFINEMENT FOR ORDERED LABELED TREES
- The \(L(h,1,1)\)-labelling problem for trees
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
- A linear time algorithm for \(L(2,1)\)-labeling of trees
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- A note on the parameterized complexity of unordered maximum tree orientation
Cites work
- Aspherical labelled oriented trees and knots
- Codes of \(m\)-complexity 1.
- Cohomology theory of groups with a single defining relation
- On adding relations to homotopy groups
- On the asphericity of regions in a 3-sphere
- Some remarks on a problem of J. H. C. Whitehead
- Spherical diagrams and labelled oriented trees
- The Whitehead conjecture -- an overview
Cited in
(5)
This page was built for publication: On the complexity of labeled oriented trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968053)
