Literatura académica sobre el tema "Trees (graph theory)"
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 "Trees (graph theory)".
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 "Trees (graph theory)"
McKee, Terry A. "Subgraph trees in graph theory". Discrete Mathematics 270, n.º 1-3 (agosto de 2003): 3–12. http://dx.doi.org/10.1016/s0012-365x(03)00161-4.
Texto completoThenge, J. D., B. Surendranath Reddy y Rupali S. Jain. "Contribution to Soft Graph and Soft Tree". New Mathematics and Natural Computation 15, n.º 01 (25 de diciembre de 2018): 129–43. http://dx.doi.org/10.1142/s179300571950008x.
Texto completoКозневски y E. Kozniewski. "Roof Skeletons and Graph Theory Trees". Geometry & Graphics 4, n.º 1 (17 de marzo de 2016): 12–20. http://dx.doi.org/10.12737/18054.
Texto completoJanson, Svante. "Random trees in a graph and trees in a random graph". Mathematical Proceedings of the Cambridge Philosophical Society 100, n.º 2 (septiembre de 1986): 319–30. http://dx.doi.org/10.1017/s0305004100066111.
Texto completoMarkhabatov, Nurlan. "Approximations of Acyclic Graphs". Bulletin of Irkutsk State University. Series Mathematics 40 (2022): 104–11. http://dx.doi.org/10.26516/1997-7670.2022.40.104.
Texto completoZeen El Deen, Mohamed R. "Enumeration of spanning trees in prisms of some graphs". Proyecciones (Antofagasta) 42, n.º 2 (1 de diciembre de 2023): 339–91. http://dx.doi.org/10.22199/issn.0717-6279-4664.
Texto completoJOHANNSEN, DANIEL, MICHAEL KRIVELEVICH y WOJCIECH SAMOTIJ. "Expanders Are Universal for the Class of All Spanning Trees". Combinatorics, Probability and Computing 22, n.º 2 (3 de enero de 2013): 253–81. http://dx.doi.org/10.1017/s0963548312000533.
Texto completoRaczek, Joanna y Rita Zuazua. "Progress on Roman and Weakly Connected Roman Graphs". Mathematics 9, n.º 16 (5 de agosto de 2021): 1846. http://dx.doi.org/10.3390/math9161846.
Texto completoFinbow, Stephen y Christopher M. van Bommel. "γ-Graphs of Trees". Algorithms 12, n.º 8 (30 de julio de 2019): 153. http://dx.doi.org/10.3390/a12080153.
Texto completoNATH, MILAN y SOMNATH PAUL. "GRAPH TRANSFORMATION AND DISTANCE SPECTRAL RADIUS". Discrete Mathematics, Algorithms and Applications 05, n.º 03 (septiembre de 2013): 1350014. http://dx.doi.org/10.1142/s1793830913500146.
Texto completoTesis sobre el tema "Trees (graph theory)"
Dawson, Shelly Jean. "Minimal congestion trees". CSUSB ScholarWorks, 2006. https://scholarworks.lib.csusb.edu/etd-project/3005.
Texto completoTang, Yin Ping Wendy. "Bandwidth of some classes of full directed trees". HKBU Institutional Repository, 1998. http://repository.hkbu.edu.hk/etd_ra/256.
Texto completoMontgomery, Richard Harford. "Minors and spanning trees in graphs". Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.709278.
Texto completoMahoney, James Raymond. "Tree Graphs and Orthogonal Spanning Tree Decompositions". PDXScholar, 2016. http://pdxscholar.library.pdx.edu/open_access_etds/2944.
Texto completoHumphries, Peter John. "Combinatorial Aspects of Leaf-Labelled Trees". Thesis, University of Canterbury. Mathematics and Statistics, 2008. http://hdl.handle.net/10092/1801.
Texto completoZhang, Xinyi. "Expected lengths of minimum spanning trees". Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 139 p, 2008. http://proquest.umi.com/pqdweb?did=1597617641&sid=6&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Texto completoTam, Wing Ka. "The strong chromatic index of cubic Halin graphs". HKBU Institutional Repository, 2003. http://repository.hkbu.edu.hk/etd_ra/516.
Texto completoJayasooriya, Arachchilage Dinush Lanka Panditharathna. "Spanning Trees of Certain Types". OpenSIUC, 2016. https://opensiuc.lib.siu.edu/theses/2049.
Texto completoCurran, Sean P. "Independent trees in 4-connected graphs". Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/29842.
Texto completoJanzen, David. "The smallest irreducible lattices in the product of trees /". Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=101884.
Texto completoLibros sobre el tema "Trees (graph theory)"
1960-, Chauvin Brigitte, Cohen Serge 1964-, Rouault Alain 1949- y Workshop on Trees (1995 : Versailles, France), eds. Trees: Workshop in Versailles, June 14-16, 1995. Basel: Birkhäuser, 1996.
Buscar texto completoLimnios, N. Fault trees. London, UK: ISTE, 2007.
Buscar texto completoIntroduction to [lambda]-trees. Singapore: World Scientific, 2001.
Buscar texto completoA, Evstigneev V., ed. Graph theory for programmers: Algorithms for processing trees. Dordrecht: Kluwer Academic, 2000.
Buscar texto completoCrouch, Peter. Trees, bialgebras and intrinsic numerical algorithms. Chicago, IL: Dept. of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 1990.
Buscar texto completoDingzhu, Du, Smith J. M y Rubinstein J. H, eds. Advances in Steiner trees. Dordrecht: Kluwer Academic, 2000.
Buscar texto completoRubin, Matatyahu. The reconstruction of trees from their automorphism groups. Providence, R.I: American Mathematical Society, 1993.
Buscar texto completoKloks, Ton. Treewidth: Computations and approximations. Berlin: Springer-Verlag, 1994.
Buscar texto completoKasʹi͡anov, V. N. Graph theory for programmers: Algorithms for processing trees. Dordrecht: Kluwer Academic, 2000.
Buscar texto completoLeister, Karen J. Using minimal spanning trees to compare the reliability of network topologies. Hampton, Va: Langley Research Center, 1990.
Buscar texto completoCapítulos de libros sobre el tema "Trees (graph theory)"
Saoub, Karin R. "Trees". En Graph Theory, 123–68. Boca Raton: CRC Press, 2021. | Series: Textbooks in mathematics: Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781138361416-3.
Texto completoSumner, David. "Forbidden Trees". En Graph Theory, 69–89. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-97686-0_8.
Texto completoRahman, Md Saidur. "Trees". En Basic Graph Theory, 47–62. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49475-3_4.
Texto completoYadav, Santosh Kumar. "Trees". En Advanced Graph Theory, 51–88. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-22562-8_2.
Texto completoDiestel, Reinhard. "Minors Trees and WQO". En Graph Theory, 333–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_12.
Texto completoHenning, Michael A. y Jan H. van Vuuren. "Trees". En Graph and Network Theory, 115–44. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-03857-0_5.
Texto completoKasyanov, Victor N. y Viadimir A. Evstigneev. "Spanning Trees". En Graph Theory for Programmers, 121–73. Dordrecht: Springer Netherlands, 2000. http://dx.doi.org/10.1007/978-94-011-4122-2_3.
Texto completoKasyanov, Victor N. y Viadimir A. Evstigneev. "Structural Trees". En Graph Theory for Programmers, 175–222. Dordrecht: Springer Netherlands, 2000. http://dx.doi.org/10.1007/978-94-011-4122-2_4.
Texto completoKasyanov, Victor N. y Viadimir A. Evstigneev. "Syntax Trees". En Graph Theory for Programmers, 293–336. Dordrecht: Springer Netherlands, 2000. http://dx.doi.org/10.1007/978-94-011-4122-2_6.
Texto completoKasyanov, Victor N. y Viadimir A. Evstigneev. "Information Trees". En Graph Theory for Programmers, 337–73. Dordrecht: Springer Netherlands, 2000. http://dx.doi.org/10.1007/978-94-011-4122-2_7.
Texto completoActas de conferencias sobre el tema "Trees (graph theory)"
Dreher, D. y J. L. Walker. "Connections between computation trees and graph covers". En 2009 Information Theory and Applications Workshop (ITA). IEEE, 2009. http://dx.doi.org/10.1109/ita.2009.5044971.
Texto completoOnete, Cristian E. y A. Maria Cristina C. Onete. "Finding spanning trees and Hamiltonian circuits in an un-oriented graph an algebraic approach". En 2011 European Conference on Circuit Theory and Design (ECCTD). IEEE, 2011. http://dx.doi.org/10.1109/ecctd.2011.6043384.
Texto completoZhou, Hong y Kwun-Lon Ting. "Spanning Tree Based Topological Optimization of Compliant Mechanisms". En ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-84608.
Texto completoYan, Hong-Sen, Feng-Ming Ou y Ming-Feng Tang. "An Algorithm for the Enumeration of Serial and/or Parallel Combinations of Kinematic Building Blocks". En ASME 2004 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/detc2004-57295.
Texto completoWu, Junran, Shangzhe Li, Jianhao Li, Yicheng Pan y Ke Xu. "A Simple yet Effective Method for Graph Classification". En Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/497.
Texto completoCohen, Jaime, Luiz A. Rodrigues y Elias P. Duarte Jr. "Improved Parallel Implementations of Gusfield’s Cut Tree Algorithm". En Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2011. http://dx.doi.org/10.5753/wscad.2011.17275.
Texto completoAlmeida, Raquel, Ewa Kijak, Simon Malinowski y Silvio Jamil F. Guimarães. "Learning on graphs and hierarchies". En Anais Estendidos da Conference on Graphics, Patterns and Images. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/sibgrapi.est.2023.27449.
Texto completoLeón, Jared. "A generalization of the block decomposition for k-connected graphs". En Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.223106.
Texto completoHuang, Xuanxiang, Yacine Izza, Alexey Ignatiev y Joao Marques-Silva. "On Efficiently Explaining Graph-Based Classifiers". En 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/34.
Texto completoHebrard, Emmanuel y George Katsirelos. "Clause Learning and New Bounds for Graph Coloring". En Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/856.
Texto completo