Literatura académica sobre el tema "Rooted tree"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Rooted tree".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Rooted tree"
Tanaka, Tatsushi. "Rooted tree maps". Communications in Number Theory and Physics 13, n.º 3 (2019): 647–66. http://dx.doi.org/10.4310/cntp.2019.v13.n3.a6.
Texto completoBéal, Sylvain, Eric Rémila y Philippe Solal. "Rooted-tree solutions for tree games". European Journal of Operational Research 203, n.º 2 (junio de 2010): 404–8. http://dx.doi.org/10.1016/j.ejor.2009.07.023.
Texto completoFumuro, Masahiko. "Comparison of Growth, Yield, and Fruit Quality of Pot-planted Mango cv. Aikou Using Own-rooted Trees Propagated by Air Layering and Grafted Trees Propagated by Conventional Methods". HortScience 54, n.º 7 (julio de 2019): 1175–80. http://dx.doi.org/10.21273/hortsci13984-19.
Texto completoGAWRON, PIOTR W., VOLODYMYR V. NEKRASHEVYCH y VITALY I. SUSHCHANSKY. "CONJUGATION IN TREE AUTOMORPHISM GROUPS". International Journal of Algebra and Computation 11, n.º 05 (octubre de 2001): 529–47. http://dx.doi.org/10.1142/s021819670100070x.
Texto completoMastakas, Konstantinos. "Drawing a rooted tree as a rooted y−monotone minimum spanning tree". Information Processing Letters 166 (febrero de 2021): 106035. http://dx.doi.org/10.1016/j.ipl.2020.106035.
Texto completoHE, YING-JUN, TRINH N. D. HUYNH, JESPER JANSSON y WING-KIN SUNG. "INFERRING PHYLOGENETIC RELATIONSHIPS AVOIDING FORBIDDEN ROOTED TRIPLETS". Journal of Bioinformatics and Computational Biology 04, n.º 01 (febrero de 2006): 59–74. http://dx.doi.org/10.1142/s0219720006001709.
Texto completoLu, Pengxin, Wayne Bell, Paul Charrette y Megan Thompson. "Performance of jack pine (Pinus banksiana) rooted cuttings from proliferated dwarf shoots versus seedlings 8 years after planting". Canadian Journal of Forest Research 42, n.º 7 (julio de 2012): 1404–9. http://dx.doi.org/10.1139/x2012-079.
Texto completoAbdulcarim, Normalah Sharief y Susan C. Dagondon. "On the Independent Neighborhood Polynomial of the Rooted Product of Two Trees". European Journal of Pure and Applied Mathematics 15, n.º 1 (31 de enero de 2022): 64–81. http://dx.doi.org/10.29020/nybg.ejpam.v15i1.4220.
Texto completoTsipouridis, C. G., A. Isaakidis, A. Manganaris, I. Therios y Z. Michailidis. "Propagation and field performance of own-rooted peach trees". Australian Journal of Experimental Agriculture 44, n.º 12 (2004): 1225. http://dx.doi.org/10.1071/ea02062.
Texto completoTakacs, Lajos. "On the total heights of random rooted trees". Journal of Applied Probability 29, n.º 3 (septiembre de 1992): 543–56. http://dx.doi.org/10.2307/3214892.
Texto completoTesis sobre el tema "Rooted tree"
Hunt, Ailsa Gaynor. "Rooted in religion : the Roman sacred tree". Thesis, University of Cambridge, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608102.
Texto completoZhao, Jinhua. "Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra". Thesis, Université Clermont Auvergne (2017-2020), 2017. http://www.theses.fr/2017CLFAC044/document.
Texto completoGiven a simple undirected graph G = (V, E) with a so-called root node r in V, a rooted tree, or an r-tree, of G is either the empty graph, or a tree containing r. If a node-capacity vector c is given, then a subgraph of G is said to be bounded if the degree of each node in the subgraph does not exceed its capacity. Let w be an edge-weight vector and p a node-price vector. The Maximum Bounded r-Tree (MBrT) problem consists of finding a bounded r-tree T = (U, F) of G such that its weight is maximized. If the capacity constraint from the MBrT problem is relaxed, we then obtain the Maximum r-Tree (MrT) problem. This dissertation contributes to the study of the MBrT problem and the MrT problem.First we introduce the problems with their definitions and complexities. We define the associated polytopes along with a formulation for each of them. We present several polynomial-time combinatorial algorithms for both the MBrT problem (and thus the MrT problem) on trees, cycles and cactus graphs. Particularly, a dynamic-programming-based algorithm is used to solve the MBrT problem on trees, whereas on cycles we reduce it to some polynomially solvable problems in three different cases. For cactus graphs, we first show that the MBrT problem can be solved in polynomial time on a so-called cactus basis, then break down the problem on any cactus graph into a series of subproblems on trees and on cactus basis.The second part of this work investigates the polyhedral structure of three polytopes associated with the MBrT problem and the MrT problem, namely Bxy(G, r, c), Bx(G, r, c) and Rx(G, r). Bxy(G, r, c) and Bx(G, r, c) are polytopes associated with the MBrT problem, where Bxy(G, r, c) considers both edge- and node-indexed variables and Bx(G, r, c) considers only edge-indexed variables. Rx(G, r) is the polytope associated with the MrT problem that only considers edge-indexed variables. For each of the three polytopes, we study their dimensions, facets as well as possible ways of decomposition. We introduce some newly discovered constraints for each polytope, and show that these new constraints allow us to characterize them on several graph classes. Specifically, we provide characterization for Bxy (G, r, c) on cactus graphs with the help of a decomposition through 1-sum. On the other hand, a TDI-system that characterizes Bx(G,r,c) is given in each case of trees and cycles. The characterization of Rx(G,r) on trees and cycles then follows as an immediate result.Finally, we discuss the separation problems for all the inequalities we have found so far, and present algorithms or cut-generation heuristics accordingly. A couple of branch-and-cut frameworks are implemented to solve the MBrT problem together with a greedy-based matheuristic. We compare the performances of the enhanced formulations with the original formulations through intensive computational test, where the results demonstrate convincingly the strength of the enhanced formulations
Snook, Michael James. "Evolution of Tandemly Repeated Sequences". Thesis, University of Canterbury. Mathematics & Statistics, 2009. http://hdl.handle.net/10092/2661.
Texto completoJax, Tim [Verfasser]. "A Rooted-Tree Based Derivation of ROW-Type Methods with Non-Exact Jacobian Entries for Index-One DAEs / Tim Jax". Wuppertal : Universitätsbibliothek Wuppertal, 2020. http://d-nb.info/1214389651/34.
Texto completoSilva, Pryscilla dos Santos Ferreira. "A post-Lie operad of rooted trees". Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-10102018-164231/.
Texto completoNessa tese propomos a descrição da operad que define as álgebras pós-Lie em termos de árvores enraizadas e discutimos algumas aplicações dessa construção. Em particular, nós obtemos novamente a álgebra pós-Lie livre definida em [22] e o resultado principal do artigo [8]. Além disso, uma possível extensão do conceito de álgebra brace simétrica à categoria de álgebras pós-Lie é apresentada.
Artemenko, Igor. "On Weak Limits and Unimodular Measures". Thèse, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/30417.
Texto completoGebhard, Madison. "Relationships Within the Family Tree: Roots of Recidivism". Scholarship @ Claremont, 2016. http://scholarship.claremont.edu/cmc_theses/1237.
Texto completoTelewski, Frank W. "Determining the Germination Date of Woody Plants: A Proposed Method for Locating the Root/Shoot Interface". Tree-Ring Society, 1993. http://hdl.handle.net/10150/262369.
Texto completoBello, Jason. "Cyclic Particle Systems on Finite Graphs and Cellular Automata on Rooted, Regular Trees and Galton-Watson Trees". The Ohio State University, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1618833498993715.
Texto completoVan, Vleck Teresa. "Ground penetrating radar in tree root detection /". Connect to resource, 1999. http://hdl.handle.net/1811/28577.
Texto completoLibros sobre el tema "Rooted tree"
Rooted together: A mother and daughter rite of passage. Michigan]: Moore Publishing, 2014.
Buscar texto completoMcMinn, R. G. Development of planting tool for long-rooted seedlings to optimize inverted humus mound performance. [Victoria, B.C.]: Forestry Canada, 1990.
Buscar texto completoBass, Hyman, Maria Victoria Otero-Espinar, Daniel Rockmore y Charles Tresser. Cyclic Renormalization and Automorphism Groups of Rooted Trees. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0096321.
Texto completo1932-, Bass Hyman, ed. Cyclic renormalization and automorphism groups of rooted trees. Berlin: Springer-Verlag, 1996.
Buscar texto completoill, Klise M. Sarah, ed. Regarding the trees: A splintered saga rooted in secrets. Orlando, Fla: Harcourt Inc., 2005.
Buscar texto completoKlise, Kate. Regarding the trees: A splintered saga rooted in secrets. Orlando, Fla: Harcourt Inc., 2005.
Buscar texto completoC, Farmer M. y Cutler D. F. 1939-, eds. Tree root plate morphology. [Bicester, Eng.]: A B Academic Publishers, Arboricultural Association, 1990.
Buscar texto completoGingras, Benoit-Marie. Bilan du développement des récipients à parois ajourées: Culture des semis en pépinière et performance en plantation comparative. [Sainte-Foy]: Ministère des ressources naturelles, Forêt Québec, Direction de la recherche forestière, 1999.
Buscar texto completoGreat Britain. Department of the Environment. y Construction Research Communications Ltd, eds. Damage to buildings caused by trees. London: Construction Research Communications, 1996.
Buscar texto completoRietveld, W. J. An integrated technique for evaluating root growth potential of tree seedlings. [Fort Collins, Colo.]: USDA Forest Service, Rocky Mountain Forest and Range Experiment Station, 1990.
Buscar texto completoCapítulos de libros sobre el tema "Rooted tree"
Fischer, Mareike, Lina Herbst, Sophie Johanna Kersting, Annemarie Luise Kühn y Kristina Wicke. "Rooted quartet index". En Tree Balance Indices, 231–39. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-39800-1_20.
Texto completoHilfinger, P., E. Lawler y G. Rote. "Flattening a rooted tree". En DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 335–40. Providence, Rhode Island: American Mathematical Society, 1991. http://dx.doi.org/10.1090/dimacs/004/26.
Texto completoPan, Pengxiang, Junran Lichen, Ping Yang y Jianping Li. "The Heterogeneous Rooted Tree Cover Problem". En Lecture Notes in Computer Science, 94–105. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-49193-1_8.
Texto completoTabatabaee, Yasamin, Sébastien Roch y Tandy Warnow. "Statistically Consistent Rooting of Species Trees Under the Multispecies Coalescent Model". En Lecture Notes in Computer Science, 41–57. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-29119-7_3.
Texto completoYamazaki, Tomoya, Akihiro Yamamoto y Tetsuji Kuboyama. "Tree PCA for Extracting Dominant Substructures from Labeled Rooted Trees". En Discovery Science, 316–23. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24282-8_27.
Texto completoFerro, A., M. Gefell, R. Kjelgren, D. S. Lipson, N. Zollinger y S. Jackson. "Maintaining Hydraulic Control Using Deep Rooted Tree Systems". En Phytoremediation, 125–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45991-x_5.
Texto completoZaki, Mohammed. "Unified Approach to Rooted Tree Mining: Algorithms and Applications". En Mining Graph Data, 381–410. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2006. http://dx.doi.org/10.1002/9780470073049.ch15.
Texto completoZhou, Jiang y Peng Zhang. "Simple Heuristics for the Rooted Max Tree Coverage Problem". En Combinatorial Optimization and Applications, 252–64. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-49611-0_18.
Texto completoGuillemot, Sylvain, Jesper Jansson y Wing-Kin Sung. "Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets". En Algorithms and Computation, 1205–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10631-6_121.
Texto completoChen, Lin y Daniel Marx. "Covering a tree with rooted subtrees – parameterized and approximation algorithms". En Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2801–20. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2018. http://dx.doi.org/10.1137/1.9781611975031.178.
Texto completoActas de conferencias sobre el tema "Rooted tree"
Hang, Xiaoshu, He Huang y Fanlun Xiong. "General rooted tree drawing algorithm". En Second International Conference on Image and Graphics, editado por Wei Sui. SPIE, 2002. http://dx.doi.org/10.1117/12.477110.
Texto completoMayhew, Gregory L. "Rooted tree graphs and de Bruijn graphs". En 2010 IEEE Aerospace Conference. IEEE, 2010. http://dx.doi.org/10.1109/aero.2010.5446922.
Texto completoYi, Shengwei, Jize Xu, Yong Peng, Qi Xiong, Ting Wang y Shilong Ma. "Mining Frequent Rooted Ordered Tree Generators Efficiently". En 2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC). IEEE, 2013. http://dx.doi.org/10.1109/cyberc.2013.29.
Texto completoSchulz, Hans-Jorg, Zabedul Akbar y Frank Maurer. "A generative layout approach for rooted tree drawings". En 2013 IEEE Pacific Visualization Symposium (PacificVis). IEEE, 2013. http://dx.doi.org/10.1109/pacificvis.2013.6596149.
Texto completoSaynez, Akram Shehadi, Maria Josefa Somodevilla, Manuel Martin Ortiz y Ivo H. Pineda. "H-Tree: A data structure for fast path-retrieval in rooted trees." En Eighth Mexican International Conference on Current Trends in Computer Science (ENC 2007). IEEE, 2007. http://dx.doi.org/10.1109/enc.2007.26.
Texto completoSaynez, Akram Shehadi, Maria Josefa Somodevilla, Manuel Martin Ortiz y Ivo H. Pineda. "H-Tree: A data structure for fast path-retrieval in rooted trees." En Eighth Mexican International Conference on Current Trends in Computer Science (ENC 2007). IEEE, 2007. http://dx.doi.org/10.1109/enc.2007.4351421.
Texto completoGuojin Cong y D. A. Bader. "The Euler tour technique and parallel rooted spanning tree". En International Conference on Parallel Processing, 2004. ICPP 2004. IEEE, 2004. http://dx.doi.org/10.1109/icpp.2004.1327954.
Texto completoByrenheid, Martin, Stefanie Roos y Thorsten Strufe. "Topology Inference of Networks utilizing Rooted Spanning Tree Embeddings". En ICDCN '22: 23rd International Conference on Distributed Computing and Networking. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3491003.3491020.
Texto completoChang, Ye-In, Chen-Chang Wu, Jun-Hong Shen y Chien-Hung Chen. "Data Classification Based on the Class-Rooted FP-Tree Approach". En 2009 International Conference on Complex, Intelligent and Software Intensive Systems (CISIS). IEEE, 2009. http://dx.doi.org/10.1109/cisis.2009.160.
Texto completoWansong Zhang, Daxin Liu y Jianpei Zhang. "Mining frequent rooted subtrees in XML data with Me-Tree". En 2004 IEEE Systems and Information Engineering Design Symposium. IEEE, 2004. http://dx.doi.org/10.1109/sieds.2004.239908.
Texto completoInformes sobre el tema "Rooted tree"
Flaishman, Moshe, Herb Aldwinckle, Shulamit Manulis y Mickael Malnoy. Efficient screening of antibacterial genes by juvenile phase free technology for developing resistance to fire blight in pear and apple trees. United States Department of Agriculture, diciembre de 2008. http://dx.doi.org/10.32747/2008.7613881.bard.
Texto completoQuillen, Brian G. Democracy - A Tree Without Roots on the Steppes of Central Asia. Fort Belvoir, VA: Defense Technical Information Center, diciembre de 2006. http://dx.doi.org/10.21236/ada462623.
Texto completoLoehle, C. y R. Jones. Adaptive significance of root grafting in trees. Office of Scientific and Technical Information (OSTI), diciembre de 1988. http://dx.doi.org/10.2172/353384.
Texto completoZhang, Xingyu, Matteo Ciantia, Jonathan Knappett y Anthony Leung. Micromechanical study of potential scale effects in small-scale modelling of sinker tree roots. University of Dundee, diciembre de 2021. http://dx.doi.org/10.20933/100001235.
Texto completoStrauss, S. H., V. Busov, K. Kosola, J. Kennedy, J. Morrell, C. Ma, A. Elias y E. Etherington. Genetic modification of gibberellic acid signaling to promote carbon sequestration in tree roots and stems. Office of Scientific and Technical Information (OSTI), mayo de 2009. http://dx.doi.org/10.2172/952484.
Texto completoBusov, Victor. GENETIC MODIFICATION OF GIBBERELLIC ACID SIGNALING TO PROMOTE CARBON SEQUESTRATION IN TREE ROOTS AND STEMS. Office of Scientific and Technical Information (OSTI), marzo de 2013. http://dx.doi.org/10.2172/1067341.
Texto completoMiller, Richard E., Timothy B. Harrington, Walter G. Thies y Jeff Madsen. Laminated root rot in a western Washington plantation: 8-year mortality and growth of Douglas-fir as related to infected stumps, tree density, and fertilization. Portland, OR: U.S. Department of Agriculture, Forest Service, Pacific Northwest Research Station, 2006. http://dx.doi.org/10.2737/pnw-rp-569.
Texto completoFurman, Alex, Jan Hopmans, Shmuel Assouline, Jirka Simunek y Jim Richards. Soil Environmental Effects on Root Growth and Uptake Dynamics for Irrigated Systems. United States Department of Agriculture, febrero de 2011. http://dx.doi.org/10.32747/2011.7592118.bard.
Texto completoDasberg, Shmuel, Jan W. Hopmans, Larry J. Schwankl y Dani Or. Drip Irrigation Management by TDR Monitoring of Soil Water and Solute Distribution. United States Department of Agriculture, agosto de 1993. http://dx.doi.org/10.32747/1993.7568095.bard.
Texto completoVenäläinen, Ari, Sanna Luhtala, Mikko Laapas, Otto Hyvärinen, Hilppa Gregow, Mikko Strahlendorff, Mikko Peltoniemi et al. Sää- ja ilmastotiedot sekä uudet palvelut auttavat metsäbiotaloutta sopeutumaan ilmastonmuutokseen. Finnish Meteorological Institute, enero de 2021. http://dx.doi.org/10.35614/isbn.9789523361317.
Texto completo