Gotowa bibliografia na temat „Graph”
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 „Graph”.
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 "Graph"
CSIKVÁRI, PÉTER, i ZOLTÁN LÓRÁNT NAGY. "The Density Turán Problem". Combinatorics, Probability and Computing 21, nr 4 (29.02.2012): 531–53. http://dx.doi.org/10.1017/s0963548312000016.
Pełny tekst źródłaCappelletti, Luca, Tommaso Fontana, Elena Casiraghi, Vida Ravanmehr, Tiffany J. Callahan, Carlos Cano, Marcin P. Joachimiak i in. "GRAPE for fast and scalable graph processing and random-walk-based embedding". Nature Computational Science 3, nr 6 (26.06.2023): 552–68. http://dx.doi.org/10.1038/s43588-023-00465-8.
Pełny tekst źródłaLiu, Yu, i Lihua You. "Further Results on the Nullity of Signed Graphs". Journal of Applied Mathematics 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/483735.
Pełny tekst źródłaJi, Shengwei, Chenyang Bu, Lei Li i Xindong Wu. "Local Graph Edge Partitioning". ACM Transactions on Intelligent Systems and Technology 12, nr 5 (31.10.2021): 1–25. http://dx.doi.org/10.1145/3466685.
Pełny tekst źródłaDuan, Yucong, Lixu Shao i Gongzhu Hu. "Specifying Knowledge Graph with Data Graph, Information Graph, Knowledge Graph, and Wisdom Graph". International Journal of Software Innovation 6, nr 2 (kwiecień 2018): 10–25. http://dx.doi.org/10.4018/ijsi.2018040102.
Pełny tekst źródłaSohn, Moo Young, i Jaeun Lee. "Characteristic polynomials of some weighted graph bundles and its application to links". International Journal of Mathematics and Mathematical Sciences 17, nr 3 (1994): 503–10. http://dx.doi.org/10.1155/s0161171294000748.
Pełny tekst źródłaJOHANNSEN, DANIEL, MICHAEL KRIVELEVICH i WOJCIECH SAMOTIJ. "Expanders Are Universal for the Class of All Spanning Trees". Combinatorics, Probability and Computing 22, nr 2 (3.01.2013): 253–81. http://dx.doi.org/10.1017/s0963548312000533.
Pełny tekst źródłaKaviya, S., G. Mahadevan i C. Sivagnanam. "Generalizing TCCD-Number For Power Graph Of Some Graphs". Indian Journal Of Science And Technology 17, SPI1 (25.04.2024): 115–23. http://dx.doi.org/10.17485/ijst/v17sp1.243.
Pełny tekst źródłaSimonet, Geneviève, i Anne Berry. "Properties and Recognition of Atom Graphs". Algorithms 15, nr 8 (19.08.2022): 294. http://dx.doi.org/10.3390/a15080294.
Pełny tekst źródłaLakshmanan S., Aparna, S. B. Rao i A. Vijayakumar. "Gallai and anti-Gallai graphs of a graph". Mathematica Bohemica 132, nr 1 (2007): 43–54. http://dx.doi.org/10.21136/mb.2007.133996.
Pełny tekst źródłaRozprawy doktorskie na temat "Graph"
Ramos, Garrido Lander. "Graph enumeration and random graphs". Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/405943.
Pełny tekst źródłaEn aquesta tesi utilitzem l'analítica combinatòria per treballar amb dos problemes relacionats: enumeració de grafs i grafs aleatoris de classes de grafs amb restriccions. En particular ens interessa esbossar un dibuix general de determinades famílies de grafs determinant, en primer lloc, quants grafs hi ha de cada mida possible (enumeració de grafs), i, en segon lloc, quin és el comportament típic d'un element de mida fixa triat a l'atzar uniformement, quan aquesta mida tendeix a infinit (grafs aleatoris). Els problemes en què treballem tracten amb grafs que satisfan condicions globals, com ara ésser planars, o bé tenir restriccions en el grau dels vèrtexs. En el Capítol 2 analitzem grafs planar aleatoris amb grau mínim dos i tres. Mitjançant tècniques de combinatòria analítica i els conceptes de nucli i kernel d'un graf, obtenim estimacions asimptòtiques precises i analitzem paràmetres rellevants de grafs aleatoris, com ara el nombre d'arestes o la mida del nucli, on obtenim lleis límit gaussianes. També treballem amb un paràmetre que suposa un repte més important: el paràmetre extremal que es correspon amb la mida de l'arbre més gran que penja del nucli. En aquest cas obtenim una estimació logarítmica per al seu valor esperat, juntament amb un resultat sobre la seva concentració. En el Capítol 3 estudiem el nombre de subgrafs isomorfs a un graf fix en classes de grafs subcrítiques. Quan el graf fix és biconnex, obtenim lleis límit gaussianes amb esperança i variància lineals. L'eina principal és l'anàlisi de sistemes infinits d'equacions donada per Drmota, Gittenberger i Morgenbesser, que utilitza la teoria d'operadors compactes. El càlcul de les constants exactes de la primera estimació dels moments en general es troba fora del nostre abast. Per a la classe de grafs sèrie-paral·lels podem calcular les constants en alguns casos particulars interessants. En el Capítol 4 enumerem grafs (arbitraris) el grau de cada vèrtex dels quals pertany a un subconjunt fix dels nombres naturals. En aquest cas les funcions generatrius associades són divergents i la nostra anàlisi utilitza l'anomenat model de configuració. El nostre resultat consisteix a obtenir estimacions asimptòtiques precises per al nombre de grafs amb un nombre de vèrtexs i arestes donat, amb la restricció dels graus. Aquest resultat generalitza àmpliament casos particulars existents, com ara grafs d-regulars, o grafs amb grau mínim com a mínim d.
Xu, Jingbo. "GRAPE : parallel graph query engine". Thesis, University of Edinburgh, 2017. http://hdl.handle.net/1842/28927.
Pełny tekst źródłaHearon, Sean M. "PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS". CSUSB ScholarWorks, 2016. https://scholarworks.lib.csusb.edu/etd/427.
Pełny tekst źródłaZuffi, Lorenzo. "Simplicial Complexes From Graphs Toward Graph Persistence". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13519/.
Pełny tekst źródłaDusart, Jérémie. "Graph searches with applications to cocomparability graphs". Paris 7, 2014. http://www.theses.fr/2014PA077048.
Pełny tekst źródłaA graph search is a mechanism for systematically visiting the vertices of a graph. It has been a fundamental technique in the design of graph algorithms since the eraarly days of computer science. Many of the early search methods were based on Breadth First Search (BFS) or Depth First Search (DFS) and resulted in efficient algorithms for practical problems such as the distance between two vertices, diameter, connectivity, network flows and the recognition of planar graphs. The purpose of this thesis is to studied the graph search. In this thesis, we present general result about graph search in cocomparability grapj, but also a new charactrization of cocomparability graph and apllications of graph search to solve the problem of transitive orientation, maximal chordal subgraph, clique perator and simplicial vertices. A simple and general framework is also presented to capture most of the well known graph search
Myers, Joseph Samuel. "Extremal theory of graph minors and directed graphs". Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.619614.
Pełny tekst źródłaHenry, Tyson Rombauer. "Interactive graph layout: The exploration of large graphs". Diss., The University of Arizona, 1992. http://hdl.handle.net/10150/185833.
Pełny tekst źródłaAraujo, Julio. "Graph coloring and graph convexity". Nice, 2012. http://www.theses.fr/2012NICE4032.
Pełny tekst źródłaIn this thesis, we study several problems of Graph Theory concerning Graph Coloring and Graph Convexity. Most of the results contained here are related to the computational complexity of these problems for particular graph classes. In the first and main part of this thesis, we deal with Graph Coloring which is one of the most studied areas of Graph Theory. We first consider three graph coloring problems called Greedy Coloring, Weighted Coloring and Weighted Improper Coloring. Then, we deal with a decision problem, called Good Edge-Labelling, whose definition was motivated by the Wavelength Assignment problem in optical networks. The second part of this thesis is devoted to a graph optimization parameter called (geodetic) hull number. The definition of this parameter is motivated by an extension to graphs of the notions of convex sets and convex hulls in the Euclidean space. Finally, we present in the appendix other works developed during this thesis, one about Eulerian and Hamiltonian directed hypergraphs and the other concerning distributed storage systems
Peternek, Fabian Hans Adolf. "Graph compression using graph grammars". Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/31094.
Pełny tekst źródłaWinerip, Jason. "Graph Linear Complexity". Scholarship @ Claremont, 2008. https://scholarship.claremont.edu/hmc_theses/216.
Pełny tekst źródłaKsiążki na temat "Graph"
Golumbic, M. C. Algorithmic graph theory and perfect graphs. Wyd. 2. Amsterdam: North Holland, 2004.
Znajdź pełny tekst źródłaBollobás, Béla. Random graphs. London: Academic Press, 1985.
Znajdź pełny tekst źródłaKolchin, V. F. Random graphs. Cambridge, UK: Cambridge University Press, 1999.
Znajdź pełny tekst źródłaRandom graphs. Wyd. 2. Cambridge: Cambridge University Press, 2001.
Znajdź pełny tekst źródłaRandom geometric graphs. Oxford: Oxford University Press, 2003.
Znajdź pełny tekst źródłaBonato, Anthony. The game of cops and robbers on graphs. Providence, R.I: American Mathematical Society, 2011.
Znajdź pełny tekst źródłaGolumbic, Martin Charles. Algorithmic graph theory and perfect graphs. Amsterdam: Elsevier, 2004.
Znajdź pełny tekst źródłaGraph it: Reading charts and graphs. New York: PowerKids Press, 2015.
Znajdź pełny tekst źródłaGraph attack!: Understanding charts and graphs. Englewood Cliffs, NJ: Cambridge Adult Education, 1993.
Znajdź pełny tekst źródłaBader, David, Henning Meyerhenke, Peter Sanders i Dorothea Wagner, red. Graph Partitioning and Graph Clustering. Providence, Rhode Island: American Mathematical Society, 2013. http://dx.doi.org/10.1090/conm/588.
Pełny tekst źródłaCzęści książek na temat "Graph"
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łaCorradini, Andrea, Barbara König i Dennis Nolte. "Specifying Graph Languages with Type Graphs". W Graph Transformation, 73–89. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61470-0_5.
Pełny tekst źródłaKurasov, Pavel. "Standard Laplacians and Secular Polynomials". W Operator Theory: Advances and Applications, 123–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2023. http://dx.doi.org/10.1007/978-3-662-67872-5_6.
Pełny tekst źródłaShekhar, Shashi, i Hui Xiong. "Graph". W Encyclopedia of GIS, 409. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_546.
Pełny tekst źródłaHinterberger, Hans. "Graph". W Encyclopedia of Database Systems, 1–2. New York, NY: Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4899-7993-3_1374-2.
Pełny tekst źródłaCalì, Carmelo. "Graph". W Lecture Notes in Morphogenesis, 225–26. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51324-5_49.
Pełny tekst źródłaWeik, Martin H. "graph". W Computer Science and Communications Dictionary, 687. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_8022.
Pełny tekst źródłaRamon, Jan. "Graph". W Encyclopedia of Systems Biology, 853. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-9863-7_1289.
Pełny tekst źródłaHinterberger, Hans. "Graph". W Encyclopedia of Database Systems, 1260–61. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_1374.
Pełny tekst źródłaIzadkhah, Habib. "Graph". W Problems on Algorithms, 471–85. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17043-0_13.
Pełny tekst źródłaStreszczenia konferencji na temat "Graph"
Zhang, Xiaotong, Han Liu, Qimai Li i Xiao-Ming Wu. "Attributed Graph Clustering via Adaptive Graph Convolution". W 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/601.
Pełny tekst źródłaPan, Shirui, Ruiqi Hu, Guodong Long, Jing Jiang, Lina Yao i Chengqi Zhang. "Adversarially Regularized Graph Autoencoder for Graph Embedding". W Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/362.
Pełny tekst źródłaKurapov, Sergey Vsevolodovich, i Maxim Vladimirovich Davidovsky. "Diakoptics and structures of graph". W Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-59.
Pełny tekst źródłaBai, Yunsheng, Hao Ding, Yang Qiao, Agustin Marinovic, Ken Gu, Ting Chen, Yizhou Sun i Wei Wang. "Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity". W 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/275.
Pełny tekst źródłaHu, Minyang, Hong Chang, Bingpeng Ma i Shiguang Shan. "Learning Continuous Graph Structure with Bilevel Programming for Graph Neural Networks". W 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/424.
Pełny tekst źródłaChen, Zijian, Rong-Hua Li, Hongchao Qin, Huanzhong Duan, Yanxiong Lu, Qiangqiang Dai i Guoren Wang. "Filtration-Enhanced Graph Transformation". W 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/276.
Pełny tekst źródłaNikolentzos, Giannis, Polykarpos Meladianos, Stratis Limnios i Michalis Vazirgiannis. "A Degeneracy Framework for Graph Similarity". W Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/360.
Pełny tekst źródłaLuo, Gongxu, Jianxin Li, Hao Peng, Carl Yang, Lichao Sun, Philip S. Yu i Lifang He. "Graph Entropy Guided Node Embedding Dimension Selection for Graph Neural Networks". W Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/381.
Pełny tekst źródłaZhao, Wenting, Yuan Fang, Zhen Cui, Tong Zhang i Jian Yang. "Graph Deformer Network". W Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/227.
Pełny tekst źródłaJin, Di, Luzhi Wang, Yizhen Zheng, Xiang Li, Fei Jiang, Wei Lin i Shirui Pan. "CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph Similarity Learning". W 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/292.
Pełny tekst źródłaRaporty organizacyjne na temat "Graph"
Selleck, C. B. GRAPH III: a digitizing and graph plotting program. Office of Scientific and Technical Information (OSTI), marzec 1986. http://dx.doi.org/10.2172/5868900.
Pełny tekst źródłaLothian, Joshua, Sarah S. Powers, Blair D. Sullivan, Matthew B. Baker, Jonathan Schrock i Stephen W. Poole. Graph Generator Survey. Office of Scientific and Technical Information (OSTI), październik 2013. http://dx.doi.org/10.2172/1122669.
Pełny tekst źródłaBurch, Kimberly Jordan. Chemical Graph Theory. Washington, DC: The MAA Mathematical Sciences Digital Library, sierpień 2008. http://dx.doi.org/10.4169/loci002857.
Pełny tekst źródłaMaunz, Peter Lukas Wilhelm, Jonathan David Sterk, Daniel Lobser, Ojas D. Parekh i Ciaran Ryan-Anderson. Quantum Graph Analysis. Office of Scientific and Technical Information (OSTI), styczeń 2016. http://dx.doi.org/10.2172/1235806.
Pełny tekst źródłaPhillips, Cynthia A. Parallel Graph Contraction. Fort Belvoir, VA: Defense Technical Information Center, maj 1989. http://dx.doi.org/10.21236/ada211916.
Pełny tekst źródłaRasmussen, Craig W. Conditional Graph Completions. Fort Belvoir, VA: Defense Technical Information Center, maj 1994. http://dx.doi.org/10.21236/ada282914.
Pełny tekst źródłaChen, Yudong, Sujay Sanghavi i Huan Xu. Improved graph clustering. Fort Belvoir, VA: Defense Technical Information Center, styczeń 2013. http://dx.doi.org/10.21236/ada596381.
Pełny tekst źródłaParekh, Ojas, Yipu Wang, Yang Ho, Cynthia Phillips, Ali Pinar, James Aimone i William Severa. Neuromorphic Graph Algorithms. Office of Scientific and Technical Information (OSTI), listopad 2021. http://dx.doi.org/10.2172/1829422.
Pełny tekst źródłaGoodman, Eric. Graph Offerings Evaluation. Office of Scientific and Technical Information (OSTI), marzec 2015. http://dx.doi.org/10.2172/1173145.
Pełny tekst źródłaHrebeniuk, Bohdan V. Modification of the analytical gamma-algorithm for the flat layout of the graph. [б. в.], grudzień 2018. http://dx.doi.org/10.31812/123456789/2882.
Pełny tekst źródła