Literatura académica sobre el tema "Graph"
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 "Graph".
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 "Graph"
CSIKVÁRI, PÉTER y ZOLTÁN LÓRÁNT NAGY. "The Density Turán Problem". Combinatorics, Probability and Computing 21, n.º 4 (29 de febrero de 2012): 531–53. http://dx.doi.org/10.1017/s0963548312000016.
Texto completoCappelletti, Luca, Tommaso Fontana, Elena Casiraghi, Vida Ravanmehr, Tiffany J. Callahan, Carlos Cano, Marcin P. Joachimiak et al. "GRAPE for fast and scalable graph processing and random-walk-based embedding". Nature Computational Science 3, n.º 6 (26 de junio de 2023): 552–68. http://dx.doi.org/10.1038/s43588-023-00465-8.
Texto completoLiu, Yu y 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.
Texto completoJi, Shengwei, Chenyang Bu, Lei Li y Xindong Wu. "Local Graph Edge Partitioning". ACM Transactions on Intelligent Systems and Technology 12, n.º 5 (31 de octubre de 2021): 1–25. http://dx.doi.org/10.1145/3466685.
Texto completoDuan, Yucong, Lixu Shao y Gongzhu Hu. "Specifying Knowledge Graph with Data Graph, Information Graph, Knowledge Graph, and Wisdom Graph". International Journal of Software Innovation 6, n.º 2 (abril de 2018): 10–25. http://dx.doi.org/10.4018/ijsi.2018040102.
Texto completoSohn, Moo Young y Jaeun Lee. "Characteristic polynomials of some weighted graph bundles and its application to links". International Journal of Mathematics and Mathematical Sciences 17, n.º 3 (1994): 503–10. http://dx.doi.org/10.1155/s0161171294000748.
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 completoKaviya, S., G. Mahadevan y C. Sivagnanam. "Generalizing TCCD-Number For Power Graph Of Some Graphs". Indian Journal Of Science And Technology 17, SPI1 (25 de abril de 2024): 115–23. http://dx.doi.org/10.17485/ijst/v17sp1.243.
Texto completoSimonet, Geneviève y Anne Berry. "Properties and Recognition of Atom Graphs". Algorithms 15, n.º 8 (19 de agosto de 2022): 294. http://dx.doi.org/10.3390/a15080294.
Texto completoBasavanagoud, B. y Roopa S. Kusugal. "On the Line Degree Splitting Graph of a Graph". Bulletin of Mathematical Sciences and Applications 18 (mayo de 2017): 1–10. http://dx.doi.org/10.18052/www.scipress.com/bmsa.18.1.
Texto completoTesis sobre el tema "Graph"
Ramos, Garrido Lander. "Graph enumeration and random graphs". Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/405943.
Texto completoEn 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.
Texto completoHearon, Sean M. "PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS". CSUSB ScholarWorks, 2016. https://scholarworks.lib.csusb.edu/etd/427.
Texto completoZuffi, Lorenzo. "Simplicial Complexes From Graphs Toward Graph Persistence". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13519/.
Texto completoDusart, Jérémie. "Graph searches with applications to cocomparability graphs". Paris 7, 2014. http://www.theses.fr/2014PA077048.
Texto completoA 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.
Texto completoHenry, Tyson Rombauer. "Interactive graph layout: The exploration of large graphs". Diss., The University of Arizona, 1992. http://hdl.handle.net/10150/185833.
Texto completoAraujo, Julio. "Graph coloring and graph convexity". Nice, 2012. http://www.theses.fr/2012NICE4032.
Texto completoIn 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.
Texto completoWinerip, Jason. "Graph Linear Complexity". Scholarship @ Claremont, 2008. https://scholarship.claremont.edu/hmc_theses/216.
Texto completoLibros sobre el tema "Graph"
Golumbic, Martin Charles. Algorithmic graph theory and perfect graphs. 2a ed. Amsterdam: North Holland, 2004.
Buscar texto completoBonato, Anthony. The game of cops and robbers on graphs. Providence, R.I: American Mathematical Society, 2011.
Buscar texto completoKolchin, V. F. Random graphs. Cambridge, UK: Cambridge University Press, 1999.
Buscar texto completoGolumbic, Martin Charles. Algorithmic graph theory and perfect graphs. Amsterdam: Elsevier, 2004.
Buscar texto completoEvstigneev, V. A. Teorii͡a︡ grafov: Algoritmy obrabotki beskonturnykh grafov. Novosibirsk: "Nauka," Sibirskoe predprii͡a︡tie RAN, 1998.
Buscar texto completoReinschke, K. J. Multivariable control: A graph-theoretic approach. Berlin: Springer-Verlag, 1988.
Buscar texto completoReinschke, K. J. Multivariable Control: A graph-theoretic approach. Berlin: Akademie-Verlag, 1988.
Buscar texto completo1949-, Hahn Geňa y Sabidussi Gert, eds. Graph symmetry: Algebraic methods and applications. Dordrecht: Kluwer Academic Publishers, 1997.
Buscar texto completoWest, Douglas Brent. Introduction to graph theory. Upper Saddle River, NJ: Prentice Hall, 1996.
Buscar texto completoBader, David, Henning Meyerhenke, Peter Sanders y Dorothea Wagner, eds. Graph Partitioning and Graph Clustering. Providence, Rhode Island: American Mathematical Society, 2013. http://dx.doi.org/10.1090/conm/588.
Texto completoCapítulos de libros sobre el tema "Graph"
Kimoto, Kazufumi. "Generalized Group–Subgroup Pair Graphs". En 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.
Texto completoCorradini, Andrea, Barbara König y Dennis Nolte. "Specifying Graph Languages with Type Graphs". En Graph Transformation, 73–89. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61470-0_5.
Texto completoKurasov, Pavel. "Standard Laplacians and Secular Polynomials". En 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.
Texto completoShekhar, Shashi y Hui Xiong. "Graph". En Encyclopedia of GIS, 409. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_546.
Texto completoHinterberger, Hans. "Graph". En 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.
Texto completoCalì, Carmelo. "Graph". En Lecture Notes in Morphogenesis, 225–26. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51324-5_49.
Texto completoWeik, Martin H. "graph". En Computer Science and Communications Dictionary, 687. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_8022.
Texto completoRamon, Jan. "Graph". En Encyclopedia of Systems Biology, 853. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-9863-7_1289.
Texto completoHinterberger, Hans. "Graph". En Encyclopedia of Database Systems, 1260–61. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_1374.
Texto completoIzadkhah, Habib. "Graph". En Problems on Algorithms, 471–85. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17043-0_13.
Texto completoActas de conferencias sobre el tema "Graph"
Zhang, Xiaotong, Han Liu, Qimai Li y Xiao-Ming Wu. "Attributed Graph Clustering via Adaptive Graph Convolution". 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/601.
Texto completoPan, Shirui, Ruiqi Hu, Guodong Long, Jing Jiang, Lina Yao y Chengqi Zhang. "Adversarially Regularized Graph Autoencoder for Graph Embedding". En 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.
Texto completoKurapov, Sergey Vsevolodovich y Maxim Vladimirovich Davidovsky. "Diakoptics and structures of graph". En 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.
Texto completoLu, Zhiyuan, Yuan Fang, Cheng Yang y Chuan Shi. "Heterogeneous Graph Transformer with Poly-Tokenization". En Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/247.
Texto completoBai, Yunsheng, Hao Ding, Yang Qiao, Agustin Marinovic, Ken Gu, Ting Chen, Yizhou Sun y Wei Wang. "Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity". 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/275.
Texto completoHu, Minyang, Hong Chang, Bingpeng Ma y Shiguang Shan. "Learning Continuous Graph Structure with Bilevel Programming for Graph Neural Networks". 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/424.
Texto completoWang, Chenhao, Yong Liu, Yan Yang y Wei Li. "HeterGCL: Graph Contrastive Learning Framework on Heterophilic Graph". En Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/265.
Texto completoChen, Zijian, Rong-Hua Li, Hongchao Qin, Huanzhong Duan, Yanxiong Lu, Qiangqiang Dai y Guoren Wang. "Filtration-Enhanced Graph Transformation". 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/276.
Texto completoNikolentzos, Giannis, Polykarpos Meladianos, Stratis Limnios y Michalis Vazirgiannis. "A Degeneracy Framework for Graph Similarity". En 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.
Texto completoLuo, Gongxu, Jianxin Li, Hao Peng, Carl Yang, Lichao Sun, Philip S. Yu y Lifang He. "Graph Entropy Guided Node Embedding Dimension Selection for Graph Neural Networks". En 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.
Texto completoInformes sobre el tema "Graph"
Selleck, C. B. GRAPH III: a digitizing and graph plotting program. Office of Scientific and Technical Information (OSTI), marzo de 1986. http://dx.doi.org/10.2172/5868900.
Texto completoLothian, Joshua, Sarah S. Powers, Blair D. Sullivan, Matthew B. Baker, Jonathan Schrock y Stephen W. Poole. Graph Generator Survey. Office of Scientific and Technical Information (OSTI), octubre de 2013. http://dx.doi.org/10.2172/1122669.
Texto completoBurch, Kimberly Jordan. Chemical Graph Theory. Washington, DC: The MAA Mathematical Sciences Digital Library, agosto de 2008. http://dx.doi.org/10.4169/loci002857.
Texto completoMaunz, Peter Lukas Wilhelm, Jonathan David Sterk, Daniel Lobser, Ojas D. Parekh y Ciaran Ryan-Anderson. Quantum Graph Analysis. Office of Scientific and Technical Information (OSTI), enero de 2016. http://dx.doi.org/10.2172/1235806.
Texto completoPhillips, Cynthia A. Parallel Graph Contraction. Fort Belvoir, VA: Defense Technical Information Center, mayo de 1989. http://dx.doi.org/10.21236/ada211916.
Texto completoRasmussen, Craig W. Conditional Graph Completions. Fort Belvoir, VA: Defense Technical Information Center, mayo de 1994. http://dx.doi.org/10.21236/ada282914.
Texto completoChen, Yudong, Sujay Sanghavi y Huan Xu. Improved graph clustering. Fort Belvoir, VA: Defense Technical Information Center, enero de 2013. http://dx.doi.org/10.21236/ada596381.
Texto completoParekh, Ojas, Yipu Wang, Yang Ho, Cynthia Phillips, Ali Pinar, James Aimone y William Severa. Neuromorphic Graph Algorithms. Office of Scientific and Technical Information (OSTI), noviembre de 2021. http://dx.doi.org/10.2172/1829422.
Texto completoGoodman, Eric. Graph Offerings Evaluation. Office of Scientific and Technical Information (OSTI), marzo de 2015. http://dx.doi.org/10.2172/1173145.
Texto completoHrebeniuk, Bohdan V. Modification of the analytical gamma-algorithm for the flat layout of the graph. [б. в.], diciembre de 2018. http://dx.doi.org/10.31812/123456789/2882.
Texto completo