On the complexity of labeled oriented trees
From MaRDI portal
Publication:968053
DOI10.1007/S12044-010-0011-6zbMATH Open1195.57011OpenAlexW2090064783MaRDI QIDQ968053FDOQ968053
Authors: Stephan Rosebrock 
Publication date: 3 May 2010
Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12044-010-0011-6
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
Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Relations of low-dimensional topology with graph theory (57M15)
Cites Work
- 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
- The Whitehead conjecture -- an overview
- Aspherical labelled oriented trees and knots
- Spherical diagrams and labelled oriented trees
- Codes of \(m\)-complexity 1.
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)
