Gotowe bibliografie tematyczne / Join of graphs

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Książki
Części książek
Streszczenia konferencji
Raporty organizacyjne

Gotowa bibliografia na temat „Join of graphs”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Join of 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 "Join of graphs"

Nieminen, Juhani. "Join space graphs." Journal of Geometry 33, no. 1-2 (1988): 99–103. http://dx.doi.org/10.1007/bf01230609.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Lukoťka, Robert, and Edita Rollová. "Flows on the join of two graphs." Mathematica Bohemica 138, no. 4 (2013): 383–96. http://dx.doi.org/10.21136/mb.2013.143511.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Akka, D. G., and J. K. Bano. "Characterization of $2$-minimally nonouterplanar join graphs." Mathematica Bohemica 126, no. 1 (2001): 1–13. http://dx.doi.org/10.21136/mb.2001.133919.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Arriola, Benjier, Shaleema Arriola, Bayah Amiruddin-Rajik, and Sherlyn Sappayani. "Independence-Preserving Operations: Effects in Polynomial Representations." International Journal of Mathematics and Computer Science 20, no. 1 (2024): 49–52. http://dx.doi.org/10.69793/ijmcs/01.2025/bayad.

Pełny tekst źródła

Streszczenie:

In this piece of work, we show that independent sets are preserved in the join operation of graphs. The adjacency property of the join of graphs guarantees a nice representation of the independent neighborhood polynomial of the join of graphs in terms of the independent neighborhood polynomials of graphs being considered.

Style APA, Harvard, Vancouver, ISO itp.

Hassan, Javier, Anabel E. Gomorez, Ladznar S. Laja, and Eman C. Ahmad. "Formulas and Properties of 2-Hop Domination in Some Graphs." European Journal of Pure and Applied Mathematics 17, no. 2 (2024): 852–59. http://dx.doi.org/10.29020/nybg.ejpam.v17i2.5065.

Pełny tekst źródła

Streszczenie:

In this paper, 2-hop domination parameter is introduced and investigated on some special graphs and on the join of two graphs. Characterizations of 2-hop dominating sets in some special graphs are formulated to derive bounds or formulas of the parameter of these graphs. Moreover, new variant of pointwise non-domination is introduced to characterize 2-hop dominating sets in the join of two graphs. This characterization is used to calculate the exact value of 2-hop domination number of the join of two graphs.

Style APA, Harvard, Vancouver, ISO itp.

Kwaśnik, Maria, and Danuta Michalak. "The join of graphs and the binding minimality." Časopis pro pěstování matematiky 114, no. 3 (1989): 262–75. http://dx.doi.org/10.21136/cpm.1989.118377.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dong, Gui Xiang, and Xiu Fang Liu. "Incidence Coloring Number of Some Join Graphs." Applied Mechanics and Materials 602-605 (August 2014): 3185–88. http://dx.doi.org/10.4028/www.scientific.net/amm.602-605.3185.

Pełny tekst źródła

Streszczenie:

The incidence coloring of a graph is a mapping from its incidence set to color set in which neighborly incidences are assigned different colors. In this paper, we determined the incidence coloring numbers of some join graphs with paths and paths, cycles, complete graphs, complete bipartite graphs, respectively, and the incidence coloring numbers of some join graphs with complete bipartite graphs and cycles, complete graphs, respectively.

Style APA, Harvard, Vancouver, ISO itp.

Adame, Luis Enrique, Luis Manuel Rivera, and Ana Laura Trujillo-Negrete. "Hamiltonicity of Token Graphs of Some Join Graphs." Symmetry 13, no. 6 (2021): 1076. http://dx.doi.org/10.3390/sym13061076.

Pełny tekst źródła

Streszczenie:

Let G be a simple graph of order n with vertex set V(G) and edge set E(G), and let k be an integer such that 1≤k≤n−1. The k-token graph G{k} of G is the graph whose vertices are the k-subsets of V(G), where two vertices A and B are adjacent in G{k} whenever their symmetric difference A▵B, defined as (A∖B)∪(B∖A), is a pair {a,b} of adjacent vertices in G. In this paper we study the Hamiltonicity of the k-token graphs of some join graphs. We provide an infinite family of graphs, containing Hamiltonian and non-Hamiltonian graphs, for which their k-token graphs are Hamiltonian. Our result provides

Style APA, Harvard, Vancouver, ISO itp.

Manju, V. N., T. B. Athul, and G. Suresh Singh. "SOME BOUNDS FOR THE WIENER INDEX OF WEAK JOIN OF TWO GRAPHS." Advances in Mathematics: Scientific Journal 12, no. 1 (2023): 107–13. http://dx.doi.org/10.37418/amsj.12.1.7.

Pełny tekst źródła

Streszczenie:

In 2020, G. Suresh Singh and Manju V. N. \cite{mvn} introduced the concept of weak join of two disjoint graphs with respect to the degrees of the given graphs and categorized them as homogeneous weak join, heterogeneous weak join and studied some of their properties. Homogeneous weak join can be splitted in to three cases namely, odd to odd degree weak join, even to even degree weak join, odd to odd and even to even degree weak join. Similarly, heterogeneous weak join includes the other three cases namely, odd to even degree weak join, even to odd degree weak join, odd to even and even to odd

Style APA, Harvard, Vancouver, ISO itp.

Dr., S.Nagarajan, G.Kayalvizhi, and G.Priyadharsini. "HF-Index and Y-Index of Some New Graph of Operations." International Journal of Engineering and Advanced Technology (IJEAT) 11, no. 3 (2022): 28–33. https://doi.org/10.35940/ijeat.C3351.0211322.

Pełny tekst źródła

Streszczenie:

In this paper we derive HF index of some graph operations containing join, Cartesian Product, Corona Product of graphs and compute the Y index of new operations of graphs related to the join of graphs

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "Join of graphs"

Trunck, Théophile. "Trigraphes de Berge apprivoisés." Thesis, Lyon, École normale supérieure, 2014. http://www.theses.fr/2014ENSL0929/document.

Pełny tekst źródła

Streszczenie:

L'objectif de cette thèse est de réussir à utiliser des décompositions de graphes afin de résoudre des problèmes algorithmiques sur les graphes. Notre objet d'étude principal est la classe des graphes de Berge apprivoisés. Les graphes de Berge sont les graphes ne possédant ni cycle de longueur impaire supérieur à 4 ni complémentaire de cycle de longueur impaire supérieure à 4. Dans les années 60, Claude Berge a conjecturé que les graphes de Berge étaient des graphes parfaits. C'est-à-dire que la taille de la plus grande clique est exactement le nombre minimum de couleurs nécessaire à une color

Style APA, Harvard, Vancouver, ISO itp.

Barazer, Simon. "Geometric recursion and volumes of moduli spaces : Oriented ribbon graphs, acyclic decomposion, “Cut-and-Join” operators." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASM003.

Pełny tekst źródła

Streszczenie:

Dans cette thèse on étudie les liens entre les récurrences topologique et géométrique et les volumes de Masur-Veech des espaces des modules des différentielles quadratiques et Abéliennes. On a choisi de s'intéresser aux graphes en rubans car ils peuvent être utilisé pour calculer les volumes de Masur-Veech. Dans le cas des graphes trivalents on propose une formule de récurrence géométrique, qui a été donnée indépendamment dans "On the Kontsevich geometry of the combinatorial Teichmüller space". On étudie ensuite les graphes en rubans orientés, dans ce cas on propose une décomposition des graph

Style APA, Harvard, Vancouver, ISO itp.

Candel, Gaëlle. "Connecting graphs to machine learning." Electronic Thesis or Diss., Université Paris sciences et lettres, 2022. http://www.theses.fr/2022UPSLE018.

Pełny tekst źródła

Streszczenie:

L’objet de cette thèse est de proposer des approches nouvelles permettant l’utilisation d’algorithmes d’apprentissage automatique travaillant usuellement des données tabulaires aux graphes. Un graphe est une structure de donnée composée de nœuds reliés entre eux par des liens. Cette structure peut être représentée sous la forme d’une matrice, où chaque connexion entre de nœuds est représentée par une valeur non nulle, permettant une manipulation des données plus facile. Néanmoins, par leurs différences structurelles, la transposition d’un algorithme exploitant des données tabulaires aux graphe

Style APA, Harvard, Vancouver, ISO itp.

Rao, Michaël. "Décompositions de graphes et algorithmes efficaces." Metz, 2006. http://docnum.univ-lorraine.fr/public/UPV-M/Theses/2006/Rao.Michael.SMZ0607.pdf.

Pełny tekst źródła

Streszczenie:

Ce mémoire traite de la décomposition modulaire ainsi que différentes de ses généralisations. Dans un premier temps, on explique comment se servir de décompositions pour résoudre efficacement certains problèmes sur les graphes. En particulier, en utilisant la décomposition modulaire, on obtient des algorithmes linéaires pour les problèmes " ensemble stable ", " clique ", " nombre chromatique " et " partition en cliques " sur les graphes sans P_5 et gem induit. On étudie également comment la décomposition en coupes peut servir pour calculer le nombre chromatique, et on exhibe une nouvelle class

Style APA, Harvard, Vancouver, ISO itp.

Narne, Kavya. "COMPARISON OF GRAPH DATABASES AND THE JOIN CORE." OpenSIUC, 2016. https://opensiuc.lib.siu.edu/theses/2032.

Pełny tekst źródła

Streszczenie:

We are now in an era where the technology has rapidly become democratized. The restrictions of relational databases to address the requirements of contemporary application domains, such as semantic web and social networking, where data has an inherited graph structure underlying in it, leads to the development of new technology called Graph Databases. Graph databases can be defined as those in which data structures for the schema and instances are modelled as graphs and data manipulation is expressed by graph-traversal operations. On the other hand, the Complexity involved in the relational mo

Style APA, Harvard, Vancouver, ISO itp.

Shi, Xiaomeng Ph D. Massachusetts Institute of Technology. "Joint base-calling of two DNA sequences with factor graphs." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45868.

Pełny tekst źródła

Streszczenie:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.<br>Includes bibliographical references (p. 63-65).<br>The advent of DNA sequencing has revolutionized biological research by providing virtual blueprints of living organisms and offering insights into complicated biochemical processes. DNA sequencing is a process encompassing both chemical reactions and signal processing techniques to identify the order of chemical bases in a DNA molecule. In this thesis, we focus on the base-calling stage, during which base order is estimated from

Style APA, Harvard, Vancouver, ISO itp.

Przytula, Tomasz Krzystof. "Emersonian philosophy in John Steinbeck's The Grapes of Wrath." Florianópolis, SC, 2003. http://repositorio.ufsc.br/xmlui/handle/123456789/85672.

Pełny tekst źródła

Streszczenie:

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro de Comunicação e Expressão. Programa de Pós-Graduação em Leetras/Inglês e Literatura Correspondente.<br>Made available in DSpace on 2012-10-20T21:27:00Z (GMT). No. of bitstreams: 1 193678.pdf: 367847 bytes, checksum: 5992d54121bacddb2a1c87efd5966854 (MD5)

Style APA, Harvard, Vancouver, ISO itp.

Bui, Anh Duc. "Visual Scene Understanding through Scene Graph Generation and Joint Learning." Thesis, University of Sydney, 2023. https://hdl.handle.net/2123/29954.

Pełny tekst źródła

Streszczenie:

Deep visual scene understanding is an essential part for the development of high-level visual understanding tasks such as storytelling or Visual Question Answering. One of the proposed solutions for such purposes were Scene Graphs, with the capacity to represent the semantic details of images into abstract elements using a graph structure which is both suitable for machine processing as well as human understanding. However, automatically generating reasonable and informative scene graphs remains a challenge due to the problem of long tail biases present in the annotated data available. Therefo

Style APA, Harvard, Vancouver, ISO itp.

Steinbrecher, Stephanie A. "The Philosophy of Ecology in John Steinbeck's The Grapes of Wrath." Scholarship @ Claremont, 2016. http://scholarship.claremont.edu/scripps_theses/866.

Pełny tekst źródła

Streszczenie:

This thesis explores the possibilities for ecocritical study in fiction through John Steinbeck’s 1939 novel The Grapes of Wrath. Major ecocritical interpretation has yet to gain much traction in novels; by focusing on human nature, this form’s “anthropocentric” posture seems itself to be antithetical to ecocritical efforts, which aim to unseat humans as the center of the moral universe. However, by analyzing The Grapes of Wrath’s formal, narratorial, and thematic valences, I argue that principles of social justice concurrently imply environmental justice in the philosophical currents of the te

Style APA, Harvard, Vancouver, ISO itp.

Zhang, Wangda, and 张望达. "Evaluating multi-way joins over discounted hitting time." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hdl.handle.net/10722/196484.

Pełny tekst źródła

Streszczenie:

The prevalence of graphs in emerging applications has recently raised a lot of research interests. To acquire interesting information hidden in large graphs, tasks including link prediction, collaborative recommendation, and reputation ranking, all make use of proximities between graph nodes. The discounted hitting time (DHT), which is a random-walk similarity measure for graph node pairs, has shown to be useful in various applications. In this thesis, we examine a novel query, called the multi-way join (or n-way join), over DHT scores. Given a graph and n sets of nodes, the n-way join retriev

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Książki na temat "Join of graphs"

Xu, Bin, Bing Qin, Yannis Tzitzikas, et al., eds. China Conference on Knowledge Graph and Semantic Computing and International Joint Conference on Knowledge Graphs. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-1809-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

1902-1968, Steinbeck John, ed. John Steinbeck's The grapes of wrath. Penguin Books, 1991.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Harold, Bloom, ed. John Steinbeck's The grapes of wrath. Chelsea House Publishers, 1996.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Harold, Bloom, ed. John Steinbeck's The grapes of wrath. Chelsea House Publishers, 2007.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Harold, Bloom, ed. John Steinbeck's The grapes of wrath. Chelsea House Publishers, 2005.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Harold, Bloom, ed. John Steinbeck's The grapes of wrath. Chelsea House Publishers, 1988.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Galati, Frank. John Steinbeck's The grapes of wrath. Dramatists Play Service, 1991.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Galati, Frank. John Steinbeck's The grapes of wrath. Fireside Theatre, 1990.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Galati, Frank. John Steinbeck's The grapes of wrath. Dramatists Play Service, 1991.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Galati, Frank. John Steinbeck's The grapes of wrath. Fireside Theatre, 1990.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Części książek na temat "Join of graphs"

Georgiadis, Loukas, Stavros D. Nikolopoulos, and Leonidas Palios. "Join-Reachability Problems in Directed Graphs." In Computer Science – Theory and Applications. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20712-9_15.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Kavaskar, T. "Perfectness of G-generalized Join of Graphs." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-25211-2_13.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Shrimali, N. P., and A. K. Rathod. "Total Neighborhood Prime Labeling of Join Graphs." In Recent Advancements in Graph Theory. CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-12.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Prabhu, S., and Y. Sherlin Nisha. "On Detour Index of Join of Graphs." In Lecture Notes in Electrical Engineering. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-9019-1_82.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Hou, Hailong, Aifen Feng, and Rui Gu. "End-Orthodox Graphs Which Are the Join of N Split Graphs." In Advances in Intelligent Systems and Computing. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-33030-8_33.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Miao, Hao, Jiazun Chen, Yang Lin, Mo Xu, Yinjun Han, and Jun Gao. "JG2Time: A Learned Time Estimator for Join Operators Based on Heterogeneous Join-Graphs." In Database Systems for Advanced Applications. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30637-2_9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Garces, Ian June L., and Jose B. Rosario. "The Metric Dimension of the Join of Paths and Cycles." In Discrete and Computational Geometry, Graphs, and Games. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-90048-9_5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Malnegro, Analen, and Gina Malacas. "Global Location-Domination in the Join and Cartesian Product of Graphs." In Discrete and Computational Geometry, Graphs, and Games. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-90048-9_4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Galkin, Mikhail, Diego Collarana, Ignacio Traverso-Ribón, Maria-Esther Vidal, and Sören Auer. "SJoin: A Semantic Join Operator to Integrate Heterogeneous RDF Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64468-4_16.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Ming-Zhong, Mo, and Pan Yu-Mei. "[r, s,t] – Colouring of One Kind of Join Graphs." In Proceedings of the 2012 International Conference on Communication, Electronics and Automation Engineering. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-31698-2_93.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Join of graphs"

Jothi, R. Mary Jeya, D. Angel, and Emalda Roslin. "On the Graph Join of Two Graph Classes of SSP Graphs." In 2024 First International Conference on Innovations in Communications, Electrical and Computer Engineering (ICICEC). IEEE, 2024. https://doi.org/10.1109/icicec62498.2024.10808535.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Zatesko, Leandro M., Renato Carmo, and André L. P. Guedes. "Novel Procedures for Graph Edge-colouring." In XXXII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/ctd.2019.6331.

Pełny tekst źródła

Streszczenie:

We present a novel recolouring procedure for graph edge-colouring. We show that all graphs whose vertices have local degree sum not too large can be optimally edge-coloured in polynomial time. We also show that the set ofthe graphs satisfying this condition includes almost every graph (under the uniform distribution). We present further results on edge-colouring join graphs, chordal graphs, circular-arc graphs, and complementary prisms, whose proofs yield polynomial-time algorithms. Our results contribute towards settling the Over- full Conjecture, the main open conjecture on edge-colouring si

Style APA, Harvard, Vancouver, ISO itp.

Shyama, S., and Radha R. Iyer. "Irregular coloring of Join of two graphs and Platonic graphs." In 2022 Second International Conference on Computer Science, Engineering and Applications (ICCSEA). IEEE, 2022. http://dx.doi.org/10.1109/iccsea54677.2022.9936414.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Wang, Suyi, Yusu Wang, and Rephael Wenger. "The JS-graphs of Join and Split Trees." In Annual Symposium. ACM Press, 2014. http://dx.doi.org/10.1145/2582112.2582162.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Neumann, Thomas, and Gerhard Weikum. "Scalable join processing on very large RDF graphs." In the 35th SIGMOD international conference. ACM Press, 2009. http://dx.doi.org/10.1145/1559845.1559911.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Wang, Zhao, Yaping Mao, Christopher Melekian, and Eddie Cheng. "Steiner Distance in Join, Corona and Threshold Graphs." In 2017 14th International Symposium on Pervasive Systems, Algorithms and Networks (ISPAN), 2017 11th International Conference on Frontiers of Computer Science and Technology (FCST), & 2017 Third International Symposium of Creative Computing (ISCC). IEEE, 2017. http://dx.doi.org/10.1109/ispan-fcst-iscc.2017.39.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Zatesko, Leandro M., Renato Carmo, and André L. P. Guedes. "Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs." In 7th International Conference on Operations Research and Enterprise Systems. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0006627102470253.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Fletcher, George H. L., and Peter W. Beck. "Scalable indexing of RDF graphs for efficient join processing." In Proceeding of the 18th ACM conference. ACM Press, 2009. http://dx.doi.org/10.1145/1645953.1646159.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Sugeng, Kiki A., R. Arkan Gilang, and Denny R. Silaban. "Harmonious labeling on some join and Cartesian product of graphs." In THE 4TH INDOMS INTERNATIONAL CONFERENCE ON MATHEMATICS AND ITS APPLICATION (IICMA 2019). AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0017244.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Wang, Tao, Pingpeng Yuan, Xiaofei Liao, and Hai Jin. "Parallel Processing SPARQL Theta Join on Large Scale RDF Graphs." In GLOBECOM 2018 - 2018 IEEE Global Communications Conference. IEEE, 2018. http://dx.doi.org/10.1109/glocom.2018.8647646.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Join of graphs"

Leis and Zhu. L51870 Unequal Wall-Thickness Pipeline Transition Joint Design Criterion Based on Plastic Collapse. Pipeline Research Council International, Inc. (PRCI), 2004. http://dx.doi.org/10.55274/r0011182.

Pełny tekst źródła

Streszczenie:

The committee�s objectives for this project were: to determine the limit of wall-thickness and properties mismatch for safe serviceability when joining high strength grades with high Y/T to lower strength grades with much lower Y/T, and to develop guidelines for joint design that ensure failure is controlled by plastic-collapse in the higher-strength thinner wall line pipe.

Style APA, Harvard, Vancouver, ISO itp.

Bambha, Neal K., and Shuvra S. Bhattacharyya. A Joint Power/Performance Optimization Algorithm for Multiprocessor Systems Using a Period Graph Construct. Defense Technical Information Center, 2000. http://dx.doi.org/10.21236/ada456719.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Lynk, John. PR-610-163756-WEB Material Strength Verification. Pipeline Research Council International, Inc. (PRCI), 2019. http://dx.doi.org/10.55274/r0011573.

Pełny tekst źródła

Streszczenie:

DATE: Tuesday, April 30, 2019 TIME: 11:00 a.m. ET CLICK THE DOWNLOAD/BUY BUTTON TO ACCESS THE WEBINAR REGISTRATION LINK Join the PRCI Integrity and Inspection technical committee for a pipeline operator driven discussion regarding PRCI research related to non-destructive technologies for the purpose of pipe material verification and how operators have applied this research in the field. This webinar will include; research project overview, operator case studies and analysis of current technology gaps. Panelists: Mark Piazza, Manager Pipeline Compliance and R and D, Colonial Pipeline Company Mi

Style APA, Harvard, Vancouver, ISO itp.

Robertson, Neil, and Paul Seymour. Graph Structure Theory: Proceedings of a Joint Summer Research Conference on Graph Minors Held June 22 to July 5, 1991, at the University of Washington, Seattle. Contemporary Mathematics 147. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada266435.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Lindsey, Lawrence, and Richard Steinberg. Joint Crowdout: An Empirical Study of the Impact of Federal Grants on State Government Expenditures and Charitable Donations. National Bureau of Economic Research, 1990. http://dx.doi.org/10.3386/w3226.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Rushing, John, Webster Floyd, Stephen Turner, et al. The 2023 Joint Airfield Damage Repair Symposium (JADRS) at Fort Liberty, North Carolina. Engineer Research and Development Center (U.S.), 2025. https://doi.org/10.21079/11681/49609.

Pełny tekst źródła

Streszczenie:

The US Army Engineer Research and Development Center (ERDC) and the 20th Engineer Brigade, 27th Engineer Battalion, executed the Joint Airfield Damage Repair Symposium from 5 to 14 June 2023. The event was a training experience for personnel executing pavement-repair tasks and a planning and coordination exercise for senior military and civilian leaders developing technologies and plans for airfield damage repair (ADR). The participants included 14 trainers, 8 staff members, 48 observers, and 145 trainees from the US Army, Air Force, Navy, and Marines. The Military Occupational Specialty of mo

Style APA, Harvard, Vancouver, ISO itp.

Leis. L51845 Database of Mechanical and Toughness Properties of Pipe. Pipeline Research Council International, Inc. (PRCI), 2000. http://dx.doi.org/10.55274/r0010150.

Pełny tekst źródła

Streszczenie:

�The lower-strength grades of steel used for transmission pipelines into the 60s were much like those used in other steel construction in that era. These steels gained strength by traditional hardening mechanisms through chemistry changes, largely involving carbon and manganese additions. Improvement of these grades, primarily through control of ingot chemistry and steel processing, became necessary when running brittle fracture was identified as a failure mechanism in gas-transmission pipelines in the late 50s. Eventually, this avenue to increasing strength was exhausted for pipeline applicat

Style APA, Harvard, Vancouver, ISO itp.

Cram, Jana, Mary Levandowski, Kaci Fitzgibbon, and Andrew Ray. Water resources summary for the Snake River and Jackson Lake Reservoir in Grand Teton National Park and John D. Rockefeller, Jr. Memorial Parkway: Preliminary analysis of 2016 data. National Park Service, 2021. http://dx.doi.org/10.36967/nrr-2285179.

Pełny tekst źródła

Streszczenie:

This report summarizes discharge and water quality monitoring data for the Snake River and Jackson Lake reservoir levels in Grand Teton National Park and John D. Rockefeller, Jr. Memorial Parkway for calendar year 2016. Annual and long-term discharge summaries and an evaluation of chemical conditions relative to state and federal water quality standards are presented. These results are considered provisional, and may be subject to change. River Discharge: Hydrographs for the Snake River at Flagg Ranch, WY, and Moose, WY, exhibit a general pattern of high early summer flows and lower baseflows

Style APA, Harvard, Vancouver, ISO itp.

Beck, Aaron. PRECLEAR: PRE-assessment to monitor consequences of marine munitions CLEARance, Cruise No. AL609, 20 – 28 March 2024, Kiel (DE) – Kiel (DE). GEOMAR Helmholtz Centre for Ocean Research Kiel, Germany, 2024. https://doi.org/10.3289/cr_al609.

Pełny tekst źródła

Streszczenie:

Cruise AL609 was a rapid-response cruise with RV ALKOR as part of the funded BMBF joint project CONMAR (CONcepts for conventional MArine Munition Remediation in the German North and Baltic Sea). The project is led by GEOMAR with eight additional partners (AWI, GCF, IOW, Senckenberg, Thünen, UBA, UKSH, URO) within the DAM Mission “Protection and sustainable use of marine areas”. One of the primary objectives of the CONMAR project is to provide the scientific support for commercial and industrial remediation of marine munitions. The first such clearance is now planned with financing through the

Style APA, Harvard, Vancouver, ISO itp.

Mawassi, Munir, and Valerian V. Dolja. Role of the viral AlkB homologs in RNA repair. United States Department of Agriculture, 2014. http://dx.doi.org/10.32747/2014.7594396.bard.

Pełny tekst źródła

Streszczenie:

AlkB proteins that repair DNA via reversing methylation damage are conserved in a broad range of prokaryotes and eukaryotes including plants. Surprisingly, AlkB-domains were discovered in the genomes of numerous plant positive-strand RNA viruses, majority of which belong to the family Flexiviridae. The major goal of this research was to reveal the AlkB functions in the viral infection cycle using a range of complementary genetic and biochemical approaches. Our hypotheses was that AlkB is required for efficient replication and genetic stability of viral RNA genomes The major objectives of the r

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!