Gotowa bibliografia na temat „Generalized graphs”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Generalized graphs”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Generalized graphs"
Sedláček, Jiří. "On generalized outerplanarity of line graphs". Časopis pro pěstování matematiky 115, nr 3 (1990): 273–77. http://dx.doi.org/10.21136/cpm.1990.118405.
Pełny tekst źródłaSamanta, Sovan, i Biswajit Sarkar. "Generalized fuzzy Euler graphs and generalized fuzzy Hamiltonian graphs". Journal of Intelligent & Fuzzy Systems 35, nr 3 (1.10.2018): 3413–19. http://dx.doi.org/10.3233/jifs-17322.
Pełny tekst źródłaDas, Angsuman, Sucharita Biswas i Manideepa Saha. "Generalized Andrásfai Graphs". Discussiones Mathematicae - General Algebra and Applications 42, nr 2 (2022): 449. http://dx.doi.org/10.7151/dmgaa.1401.
Pełny tekst źródłaMarušič, Dragan, Raffaele Scapellato i Norma Zagaglia Salvi. "Generalized Cayley graphs". Discrete Mathematics 102, nr 3 (maj 1992): 279–85. http://dx.doi.org/10.1016/0012-365x(92)90121-u.
Pełny tekst źródłaZverovich, Igor E. "Generalized Matrogenic Graphs". Annals of Combinatorics 10, nr 2 (wrzesień 2006): 285–90. http://dx.doi.org/10.1007/s00026-006-0288-4.
Pełny tekst źródłaLovász, László, i Vera T. Sós. "Generalized quasirandom graphs". Journal of Combinatorial Theory, Series B 98, nr 1 (styczeń 2008): 146–63. http://dx.doi.org/10.1016/j.jctb.2007.06.005.
Pełny tekst źródłaBrand, Neal, i Margaret Morton. "Generalized steinhaus graphs". Journal of Graph Theory 20, nr 1 (sierpień 1995): 47–58. http://dx.doi.org/10.1002/jgt.3190200105.
Pełny tekst źródłaAlon, Noga, i Edward R. Scheinerman. "Generalized sum graphs". Graphs and Combinatorics 8, nr 1 (marzec 1992): 23–29. http://dx.doi.org/10.1007/bf01271705.
Pełny tekst źródłaIRSİC, VESNA, SANDI KLAVZAR i ELİF TAN. "Generalized Pell graphs". Turkish Journal of Mathematics 47, nr 7 (9.11.2023): 1955–73. http://dx.doi.org/10.55730/1300-0098.3475.
Pełny tekst źródłaLimaye, N. B., i Mulupuri Shanthi C. Rao. "On $2$-extendability of generalized Petersen graphs". Mathematica Bohemica 121, nr 1 (1996): 77–81. http://dx.doi.org/10.21136/mb.1996.125939.
Pełny tekst źródłaRozprawy doktorskie na temat "Generalized graphs"
Hennayake, Kamal P. "Generalized edge connectivity in graphs". Morgantown, W. Va. : [West Virginia University Libraries], 1998. http://etd.wvu.edu/templates/showETD.cfm?recnum=383.
Pełny tekst źródłaTitle from document title page. Document formatted into pages; contains v, 87 p. : ill. Includes abstract. Includes bibliographical references (p. 64-72).
Pensaert, William. "Hamilton Paths in Generalized Petersen Graphs". Thesis, University of Waterloo, 2002. http://hdl.handle.net/10012/1198.
Pełny tekst źródłaAli, Seema. "Colouring generalized Kneser graphs and homotopy theory". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0014/MQ34938.pdf.
Pełny tekst źródłaNukala, Murthy V. R. K. N. "Generalized models of design iteration using signal flow graphs". Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/11486.
Pełny tekst źródłaWerner, Rose-Line. "Concrete constructions of unbalanced bipartite expander graphs and generalized conductors". Zürich : ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für Informationssysteme, 2008. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=389.
Pełny tekst źródłaSanford, Alice Jewel. "Cycle spectra, automorphic uniqueness, and isomorphism classes of generalized Petersen graphs /". Full text available from ProQuest UM Digital Dissertations, 2005. http://0-proquest.umi.com.umiss.lib.olemiss.edu/pqdweb?index=0&did=1264606591&SrchMode=1&sid=3&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1185199901&clientId=22256.
Pełny tekst źródłaSharifiyazdi, Elham [Verfasser]. "The clique number of generalized Hamming graphs / submitted by Elham Sharifiyazdi". [Clausthal-Zellerfeld] : [Univ.-Bibliothek], 2007. http://d-nb.info/986579076/34.
Pełny tekst źródłaKnechtel, lessa Micheli. "Extended Generalized Blockmodeling". Thesis, Avignon, 2021. http://www.theses.fr/2021AVIG0281.
Pełny tekst źródłaBlockmodeling is a set of techniques initially designed to analyse social networks but whose practical interest becomes larger, as we will see further in this thesis for terminology graphs. One of the goals of blockmodeling is to reduce a large, potentially incoherent network to a smaller comprehensible structure that can be interpreted more readily. There is great interest in capturing the cluster structure of a network in terms of equivalences, blocks and partitions. Up to now, most blockmodeling methods are focused in fitting the network structure to only one type of structure pattern. However, there are a variety of social networking applications in which it is interesting to consider more than one type of pattern simultaneously, so that the structure of the network can take the form of several indicators for underlying relationships. The research question is, how to deal with the situations where an analyst has several relations types of relations for a set of actors. Thus, we propose an optimization model, which we call the extended generalized blockmodeling. The main objective of extended generalized blockmodeling is to find the partition size and the set of patterns that has the best representation of the network structure. The extended generalized blockmodeling expands the possibilities of the framework, making it possible to analyze networks without any prior knowledge about them. The extended generalized block modeling belongs to the class of highly combinatorial problems, the exact method is only suitable for small networks, so the second question is how to make this approach viable for medium and large networks. Therefore, we propose the first non-exact approach to generalized extended block modeling, based on the VNS algorithm as an alternative for medium-sized networks. Even though the results found by the heuristic may not be the best of all the solutions to the problem, the experiments show that it converges to a satisfactory result in a not prohibitively long time. The third question, which we address in this thesis, is the extended generalized blockmodeling a suitable approach in the field of bibliometrics and Natural Language processing. To do so, we analyse the network of terms concerning terrorism research. For all these questions, we demonstrate the numerical results, based on artificial and real datasets benchmarks. These results allow the exploration of the application opportunities of the extended generalized block modeling as well as it’s limitations
Djang, Claire. "Two-Coloring Cycles In Complete Graphs". Oberlin College Honors Theses / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1370618319.
Pełny tekst źródłaMooney, Christopher Park. "Generalized factorization in commutative rings with zero-divisors". Thesis, The University of Iowa, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3595128.
Pełny tekst źródłaThe study of factorization in integral domains has a long history. Unique factorization domains, like the integers, have been studied extensively for many years. More recently, mathematicians have turned their attention to generalizations of this such as Dedekind domains or other domains which have weaker factorization properties. Many authors have sought to generalize the notion of factorization in domains. One particular method which has encapsulated many of the generalizations into a single study is that of τ-factorization, studied extensively by A. Frazier and D.D. Anderson.
Another generalization comes in the form of studying factorization in rings with zero-divisors. Factorization gets quite complicated when zero-divisors are present due to the existence of several types of associate relations as well as several choices about what to consider the irreducible elements.
In this thesis, we investigate several methods for extending the theory of τ-factorization into rings with zero-divisors. We investigate several methods including: 1) the approach used by A.G. Agˇargün and D.D. Anderson, S. Chun and S. Valdes-Leon in several papers; 2) the method of U-factorization developed by C.R. Fletcher and extended by M. Axtell, J. Stickles, and N. Baeth and 3) the method of regular factorizations and 4) the method of complete factorizations.
This thesis synthesizes the work done in the theory of generalized factorization and factorization in rings with zero-divisors. Along the way, we encounter several nice applications of the factorization theory. Using τ z-factorizations, we discover a nice relationship with zero-divisor graphs studied by I. Beck as well as D.D. Anderson, D.F. Anderson, A. Frazier, A. Lauve, and P. Livingston. Using τ-U-factorization, we are able to answer many questions that arise when discussing direct products of rings.
There are several benefits to the regular factorization factorization approach due to the various notions of associate and irreducible coinciding on regular elements greatly simplifying many of the finite factorization property relationships. Complete factorization is a very natural and effective approach taken to studying factorization in rings with zero-divisors. There are several nice results stemming from extending τ-factorization in this way. Lastly, an appendix is provided in which several examples of rings satisfying the various finite factorization properties studied throughout the thesis are given.
Książki na temat "Generalized graphs"
Mikov, Aleksandr. Generalized graphs and grammars. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1013698.
Pełny tekst źródłaLi, Xueliang, i Yaping Mao. Generalized Connectivity of Graphs. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6.
Pełny tekst źródłaJong, Gjalt Gerrit de. Generalized data flow graphs: Theory and applications : proefschrift. [S.l: s.n.,], 1993.
Znajdź pełny tekst źródłaBrown, Jason Ira. A theory of generalized graph colourings. Toronto: [s.n.], 1987.
Znajdź pełny tekst źródłaFidanova, Stefka. Generalized nets in artificial intelligence: Generalized nets and ant colony optimization. Sofia: Academic Publishing House "Prof. Marin Drinov", 2011.
Znajdź pełny tekst źródłaInstitute for Computer Applications in Science and Engineering., red. Graph embeddings, symmetric real matrices, and generalized inverses. Hampton, VA: Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1998.
Znajdź pełny tekst źródłaInstitute for Computer Applications in Science and Engineering., red. Graph embeddings, symmetric real matrices, and generalized inverses. Hampton, VA: Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1998.
Znajdź pełny tekst źródłaMorvan, J. M. Generalized curvatures. Berlin: Springer, 2008.
Znajdź pełny tekst źródłaKoi, Dennis Brian. Generalized geographic mapping system for computer graphics. Galveston, Tex: National Oceanic and Atmospheric Administration, National Marine Fisheries Service, Southeast Fisheries Center, Galveston Laboratory, 1985.
Znajdź pełny tekst źródłaGhosh, Diptesh. A probabilistic tabu search algorithm for the generalized minimum spanning tree problem. Ahmedabad: Indian Institute of Management, 2003.
Znajdź pełny tekst źródłaCzęści książek na temat "Generalized graphs"
Kimoto, Kazufumi. "Generalized Group–Subgroup Pair Graphs". W International Symposium on Mathematics, Quantum Theory, and Cryptography, 169–85. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5191-8_14.
Pełny tekst źródłaAnderson, David F., T. Asir, Ayman Badawi i T. Tamizh Chelvam. "Generalized Total Graphs". W Graphs from Rings, 401–35. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88410-9_9.
Pełny tekst źródłaArnþórsson, Ívar Marrow, Steven Chaplick, Jökull Snær Gylfason, Magnús M. Halldórsson, Jökull Máni Reynisson i Tigran Tonoyan. "Generalized Disk Graphs". W Lecture Notes in Computer Science, 115–28. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83508-8_9.
Pełny tekst źródłaAnderson, David F., T. Asir, Ayman Badawi i T. Tamizh Chelvam. "Generalized Zero-divisor Graphs". W Graphs from Rings, 173–237. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88410-9_5.
Pełny tekst źródłaLi, Xueliang, i Yaping Mao. "Maximum Generalized Local Connectivity". W Generalized Connectivity of Graphs, 89–112. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6_8.
Pełny tekst źródłaLi, Xueliang, i Yaping Mao. "Introduction". W Generalized Connectivity of Graphs, 1–13. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6_1.
Pełny tekst źródłaLi, Xueliang, i Yaping Mao. "Results for Some Graph Classes". W Generalized Connectivity of Graphs, 15–29. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6_2.
Pełny tekst źródłaLi, Xueliang, i Yaping Mao. "Algorithm and Complexity". W Generalized Connectivity of Graphs, 31–39. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6_3.
Pełny tekst źródłaLi, Xueliang, i Yaping Mao. "Sharp Bounds of the Generalized (Edge-)Connectivity". W Generalized Connectivity of Graphs, 41–57. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6_4.
Pełny tekst źródłaLi, Xueliang, i Yaping Mao. "Graphs with Given Generalized Connectivity". W Generalized Connectivity of Graphs, 59–66. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6_5.
Pełny tekst źródłaStreszczenia konferencji na temat "Generalized graphs"
Matz, Gerald. "On Generalized Signature Graphs". W ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2024. http://dx.doi.org/10.1109/icassp48485.2024.10446569.
Pełny tekst źródłaHuang, Zhichao, Xutao Li, Yunming Ye i Michael K. Ng. "MR-GCN: Multi-Relational Graph Convolutional Networks based on Generalized Tensor Product". W Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/175.
Pełny tekst źródłaEbner, Dietmar, Florian Brandner, Bernhard Scholz, Andreas Krall, Peter Wiedermann i Albrecht Kadlec. "Generalized instruction selection usingSSA-graphs". W the 2008 ACM SIGPLAN-SIGBED conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1375657.1375663.
Pełny tekst źródłaSeenuvasan, P. "Generalized sum connectivity invariant of graphs". W RECENT TRENDS IN PURE AND APPLIED MATHEMATICS. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5135262.
Pełny tekst źródłaBekos, M. A., M. Kaufmann i C. N. Raftopoulou. "AVDTC of generalized 3-Halin graphs". W 2016 7th International Conference on Information, Intelligence, Systems & Applications (IISA). IEEE, 2016. http://dx.doi.org/10.1109/iisa.2016.7785421.
Pełny tekst źródłaMukherjee, Lopamudra, Vikas Singh, Jiming Peng, Jinhui Xu, Michael J. Zeitz i Ronald Berezney. "Generalized Median Graphs: Theory and Applications". W 2007 IEEE 11th International Conference on Computer Vision. IEEE, 2007. http://dx.doi.org/10.1109/iccv.2007.4408966.
Pełny tekst źródłaAngel, D., I. Annammal Arputhamary, R. Revathi i M. Nirmala. "Secure Node Covering of Cocktail Party Graphs and Generalized Fan Graphs". W 2022 Third International Conference on Intelligent Computing Instrumentation and Control Technologies (ICICICT). IEEE, 2022. http://dx.doi.org/10.1109/icicict54557.2022.9918002.
Pełny tekst źródłaPrasanna, G. N. Srinivasa, i Bruce R. Musicus. "Generalized multiprocessor scheduling for directed acylic graphs". W the 1994 ACM/IEEE conference. New York, New York, USA: ACM Press, 1994. http://dx.doi.org/10.1145/602770.602812.
Pełny tekst źródłaLi, Shengyu, Dengxin Li i Xiaomin Li. "Survivable Nets and the Generalized Permutation Graphs". W 2009 First International Conference on Information Science and Engineering. IEEE, 2009. http://dx.doi.org/10.1109/icise.2009.1153.
Pełny tekst źródłaGaretto, Michele, Emilio Leonardi i Giovanni Luca Torrisi. "Generalized Threshold-Based Epidemics in Random Graphs". W SIGMETRICS '16: SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2896377.2901455.
Pełny tekst źródłaRaporty organizacyjne na temat "Generalized graphs"
Nieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 18. Hilbert Press, 2018. http://dx.doi.org/10.56441/hilbertpress.1818.9585.
Pełny tekst źródłaNieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 20. Hilbert Press, 2020. http://dx.doi.org/10.56441/hilbertpress.2048.3738.
Pełny tekst źródłaNieto-Castanon, Alfonso. CONN functional connectivity toolbox (RRID:SCR_009550), Version 19. Hilbert Press, 2019. http://dx.doi.org/10.56441/hilbertpress.1927.9364.
Pełny tekst źródłaChen, Huiru, Youjia Qiu, Zilan Wang, Zhouqing Chen, Yan Kong i Zhong Wang. Efficacy and Safety of the Innovative Monoclonal Antibodies in Adults with Generalized Myasthenia Gravis: a Bayesian Network Analysis. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, lipiec 2023. http://dx.doi.org/10.37766/inplasy2023.7.0112.
Pełny tekst źródłaLetcher, Theodore, Julie Parno, Zoe Courville, Lauren Farnsworth i Jason Olivier. A generalized photon-tracking approach to simulate spectral snow albedo and transmittance using X-ray microtomography and geometric optics. Engineer Research and Development Center (U.S.), czerwiec 2023. http://dx.doi.org/10.21079/11681/47122.
Pełny tekst źródłaWells, Aaron, Tracy Christopherson, Gerald Frost, Matthew Macander, Susan Ives, Robert McNown i Erin Johnson. Ecological land survey and soils inventory for Katmai National Park and Preserve, 2016–2017. National Park Service, wrzesień 2021. http://dx.doi.org/10.36967/nrr-2287466.
Pełny tekst źródłaMonetary Policy Report - January 2023. Banco de la República, czerwiec 2023. http://dx.doi.org/10.32468/inf-pol-mont-eng.tr1-2023.
Pełny tekst źródłaMonetary Policy Report - January 2021. Banco de la República de Colombia, marzec 2021. http://dx.doi.org/10.32468/inf-pol-mont-eng.tr1.-2021.
Pełny tekst źródła