Bibliografías temáticas / Graph

Literatura académica sobre el tema "Graph"

Autor: Grafiati

Publicado: 4 de junio de 2021

Última modificación: 7 de julio de 2024

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Índice

Artículos de revistas
Tesis
Libros
Capítulos de libros
Actas de conferencias
Informes

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 completo

Resumen

LetHbe a graph onnvertices and let the blow-up graphG[H] be defined as follows. We replace each vertexviofHby a clusterAiand connect some pairs of vertices ofAiandAjif (vi,vj) is an edge of the graphH. As usual, we define the edge density betweenAiandAjasWe study the following problem. Given densities γijfor each edge (i,j) ∈E(H), one has to decide whether there exists a blow-up graphG[H], with edge densities at least γij, such that one cannot choose a vertex from each cluster, so that the obtained graph is isomorphic toH,i.e., noHappears as a transversal inG[H]. We calldcrit(H) the maximal value for which there exists a blow-up graphG[H] with edge densitiesd(Ai,Aj)=dcrit(H) ((vi,vj) ∈E(H)) not containingHin the above sense. Our main goal is to determine the critical edge density and to characterize the extremal graphs.First, in the case of treeTwe give an efficient algorithm to decide whether a given set of edge densities ensures the existence of a transversalTin the blow-up graph. Then we give general bounds ondcrit(H) in terms of the maximal degree. In connection with the extremal structure, the so-called star decomposition is proved to give the best construction forH-transversal-free blow-up graphs for several graph classes. Our approach applies algebraic graph-theoretical, combinatorial and probabilistic tools.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Cappelletti, 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 completo

Resumen

AbstractGraph representation learning methods opened new avenues for addressing complex, real-world problems represented by graphs. However, many graphs used in these applications comprise millions of nodes and billions of edges and are beyond the capabilities of current methods and software implementations. We present GRAPE (Graph Representation Learning, Prediction and Evaluation), a software resource for graph processing and embedding that is able to scale with big graphs by using specialized and smart data structures, algorithms, and a fast parallel implementation of random-walk-based methods. Compared with state-of-the-art software resources, GRAPE shows an improvement of orders of magnitude in empirical space and time complexity, as well as competitive edge- and node-label prediction performance. GRAPE comprises approximately 1.7 million well-documented lines of Python and Rust code and provides 69 node-embedding methods, 25 inference models, a collection of efficient graph-processing utilities, and over 80,000 graphs from the literature and other sources. Standardized interfaces allow a seamless integration of third-party libraries, while ready-to-use and modular pipelines permit an easy-to-use evaluation of graph-representation-learning methods, therefore also positioning GRAPE as a software resource that performs a fair comparison between methods and libraries for graph processing and embedding.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Liu, 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 completo

Resumen

The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. A signed graph is a graph with a sign attached to each of its edges. In this paper, we apply the coefficient theorem on the characteristic polynomial of a signed graph and give two formulae on the nullity of signed graphs with cut-points. As applications of the above results, we investigate the nullity of the bicyclic signed graphΓ∞p,q,l, obtain the nullity set of unbalanced bicyclic signed graphs, and thus determine the nullity set of bicyclic signed graphs.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ji, 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 completo

Resumen

Graph edge partitioning, which is essential for the efficiency of distributed graph computation systems, divides a graph into several balanced partitions within a given size to minimize the number of vertices to be cut. Existing graph partitioning models can be classified into two categories: offline and streaming graph partitioning models. The former requires global graph information during the partitioning, which is expensive in terms of time and memory for large-scale graphs. The latter creates partitions based solely on the received graph information. However, the streaming model may result in a lower partitioning quality compared with the offline model. Therefore, this study introduces a Local Graph Edge Partitioning model, which considers only the local information (i.e., a portion of a graph instead of the entire graph) during the partitioning. Considering only the local graph information is meaningful because acquiring complete information for large-scale graphs is expensive. Based on the Local Graph Edge Partitioning model, two local graph edge partitioning algorithms—Two-stage Local Partitioning and Adaptive Local Partitioning—are given. Experimental results obtained on 14 real-world graphs demonstrate that the proposed algorithms outperform rival algorithms in most tested cases. Furthermore, the proposed algorithms are proven to significantly improve the efficiency of the real graph computation system GraphX.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Duan, 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 completo

Resumen

Knowledge graphs have been widely adopted, in large part owing to their schema-less nature. It enables knowledge graphs to grow seamlessly and allows for new relationships and entities as needed. A knowledge graph is a graph constructed by representing each item, entity and user as nodes, and linking those nodes that interact with each other via edges. Knowledge graphs have abundant natural semantics and can contain various and more complete information. It is an expression mechanism close to natural language. However, we still lack a unified definition and standard expression form of knowledge graph. The authors propose to clarify the expression of knowledge graph as a whole. They clarify the architecture of knowledge graph from data, information, knowledge, and wisdom aspects respectively. The authors also propose to specify knowledge graph in a progressive manner as four basic forms including data graph, information graph, knowledge graph and wisdom graph.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Sohn, 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 completo

Resumen

In this paper, we introduce weighted graph bundles and study their characteristic polynomial. In particular, we show that the characteristic polynomial of a weightedK2(K¯2)-bundles over a weighted graphG?can be expressed as a product of characteristic polynomials two weighted graphs whose underlying graphs areGAs an application, we compute the signature of a link whose corresponding weighted graph is a double covering of that of a given link.

Los estilos APA, Harvard, Vancouver, ISO, etc.

JOHANNSEN, 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 completo

Resumen

A graph is calleduniversalfor a given graph class(or, equivalently,-universal) if it contains a copy of every graph inas a subgraph. The construction of sparse universal graphs for various classeshas received a considerable amount of attention. There is particular interest in tight-universal graphs, that is, graphs whose number of vertices is equal to the largest number of vertices in a graph from. Arguably, the most studied case is that whenis some class of trees. In this work, we are interested in(n,Δ), the class of alln-vertex trees with maximum degree at most Δ. We show that everyn-vertex graph satisfying certain natural expansion properties is(n,Δ)-universal. Our methods also apply to the case when Δ is some function ofn. Since random graphs are known to be good expanders, our result implies, in particular, that there exists a positive constantcsuch that the random graphG(n,cn−1/3log2n) is asymptotically almost surely (a.a.s.) universal for(n,O(1)). Moreover, a corresponding result holds for the random regular graph of degreecn2/3log2n. Another interesting consequence is the existence of locally sparsen-vertex(n,Δ)-universal graphs. For example, we show that one can (randomly) constructn-vertex(n,O(1))-universal graphs with clique number at most five. This complements the construction of Bhatt, Chung, Leighton and Rosenberg (1989), whose(n,Δ)-universal graphs with merelyO(n)edges contain large cliques of size Ω(Δ). Finally, we show that random graphs are robustly(n,Δ)-universal in the context of the Maker–Breaker tree-universality game.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Kaviya, 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 completo

Resumen

Objective: Finding the triple connected certified domination number for the power graph of some peculiar graphs. Methods: A dominating set with the condition that every vertex in has either zero or at least two neighbors in and is triple connected is a called triple connected certified domination number of a graph. The minimum cardinality among all the triple connected certified dominating sets is called the triple connected certified domination number and is denoted by . The upper bound and lower bound of for the given graphs is found and then proved the upper bound and lower bound of were equal. Findings: We found the (TCCD)-number for the power graph of some peculiar graphs. Also, we have generalized the result for path, cycle, ladder graph, comb graph, coconut tree graph, triangular snake, alternate triangular snake, quadrilateral snake and tadpole graph. Novelty: The triple connected certified domination is a new parameter in which the certified domination holds the triple connected in induced . Keywords: Domination Number, Power Graphs, Triple Connected, Certified Domination, Triple Connected Certified Domination

Los estilos APA, Harvard, Vancouver, ISO, etc.

Simonet, 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 completo

Resumen

The atom graph of a connected graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all its atom trees. A graph G is an atom graph if there is a graph whose atom graph is isomorphic to G. We study the class of atom graphs, which is also the class of atom graphs of chordal graphs, and the associated recognition problem. We prove that each atom graph is a perfect graph and give a characterization of atom graphs in terms of a spanning tree, inspired by the characterization of clique graphs of chordal graphs as expanded trees. We also characterize the chordal graphs having the same atom and clique graph, and solve the recognition problem of atom graphs of two graph classes.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Lakshmanan S., Aparna, S. B. Rao y A. Vijayakumar. "Gallai and anti-Gallai graphs of a graph". Mathematica Bohemica 132, n.º 1 (2007): 43–54. http://dx.doi.org/10.21136/mb.2007.133996.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Más fuentes

Tesis 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 completo

Resumen

In this thesis we use analytic combinatorics to deal with two related problems: graph enumeration and random graphs from constrained classes of graphs. We are interested in drawing a general picture of some graph families by determining, first, how many elements are there of a given possible size (graph enumeration), and secondly, what is the typical behaviour of an element of fixed size chosen uniformly at random, when the size tends to infinity (random graphs). The problems concern graphs subject to global conditions, such as being planar and/or with restrictions on the degrees of the vertices. In Chapter 2 we analyse random planar graphs with minimum degree two and three. Using techniques from analytic combinatorics and the concepts of core and kernel of a graph, we obtain precise asymptotic estimates and analyse relevant parameters for random graphs, such as the number of edges or the size of the core, where we obtain Gaussian limit laws. More challenging is the extremal parameter equal to the size of the largest tree attached to the core. In this case we obtain a logarithmic estimate for the expected value together with a concentration result. In Chapter 3 we study the number of subgraphs isomorphic to a fixed graph in subcritical classes of graphs. We obtain Gaussian limit laws with linear expectation and variance when the fixed graph is 2-connected. The main tool is the analysis of infinite systems of equations by Drmota, Gittenberger and Morgenbesser, using the theory of compact operators. Computing the exact constants for the first estimates of the moments is in general out of reach. For the class of series-parallel graphs we are able to compute them in some particular interesting cases. In Chapter 4 we enumerate (arbitrary) graphs where the degree of every vertex belongs to a fixed subset of the natural numbers. In this case the associated generating functions are divergent and our analysis uses instead the so-called configuration model. We obtain precise asymptotic estimates for the number of graphs with given number of vertices and edges and subject to the degree restriction. Our results generalize widely previous special cases, such as d-regular graphs or graphs with minimum degree at least d.
En 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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Xu, Jingbo. "GRAPE : parallel graph query engine". Thesis, University of Edinburgh, 2017. http://hdl.handle.net/1842/28927.

Texto completo

Resumen

The need for graph computations is evident in a multitude of use cases. To support computations on large-scale graphs, several parallel systems have been developed. However, existing graph systems require users to recast algorithms into new models, which makes parallel graph computations as a privilege to experienced users only. Moreover, real world applications often require much more complex graph processing workflows than previously evaluated. In response to these challenges, the thesis presents GRAPE, a distributed graph computation system, shipped with various applications for social network analysis, social media marketing and functional dependencies on graphs. Firstly, the thesis presents the foundation of GRAPE. The principled approach of GRAPE is based on partial evaluation and incremental computation. Sequential graph algorithms can be plugged into GRAPE with minor changes, and get parallelized as a whole. The termination and correctness are guaranteed under a monotonic condition. Secondly, as an application on GRAPE, the thesis proposes graph-pattern association rules (GPARs) for social media marketing. GPARs help users discover regularities between entities in social graphs and identify potential customers by exploring social influence. The thesis studies the problem of discovering top-k diversified GPARs and the problem of identifying potential customers with GPARs. Although both are NP- hard, parallel scalable algorithms on GRAPE are developed, which guarantee a polynomial speedup over sequential algorithms with the increase of processors. Thirdly, the thesis proposes quantified graph patterns (QGPs), an extension of graph patterns by supporting simple counting quantifiers on edges. QGPs naturally express universal and existential quantification, numeric and ratio aggregates, as well as negation. The thesis proves that the matching problem of QGPs remains NP-complete in the absence of negation, and is DP-complete for general QGPs. In addition, the thesis introduces quantified graph association rules defined with QGPs, to identify potential customers in social media marketing. Finally, to address the issue of data consistency, the thesis proposes a class of functional dependencies for graphs, referred to as GFDs. GFDs capture both attribute-value dependencies and topological structures of entities. The satisfiability and implication problems for GFDs are studied and proved to be coNP-complete and NP-complete, respectively. The thesis also proves that the validation problem for GFDs is coNP- complete. The parallel algorithms developed on GRAPE verify that GFDs provide an effective approach to detecting inconsistencies in knowledge and social graphs.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Hearon, Sean M. "PLANAR GRAPHS, BIPLANAR GRAPHS AND GRAPH THICKNESS". CSUSB ScholarWorks, 2016. https://scholarworks.lib.csusb.edu/etd/427.

Texto completo

Resumen

A graph is planar if it can be drawn on a piece of paper such that no two edges cross. The smallest complete and complete bipartite graphs that are not planar are K5 and K{3,3}. A biplanar graph is a graph whose edges can be colored using red and blue such that the red edges induce a planar subgraph and the blue edges induce a planar subgraph. In this thesis, we determine the smallest complete and complete bipartite graphs that are not biplanar.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Zuffi, Lorenzo. "Simplicial Complexes From Graphs Toward Graph Persistence". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13519/.

Texto completo

Resumen

Persistent homology is a branch of computational topology which uses geometry and topology for shape description and analysis. This dissertation is an introductory study to link persistent homology and graph theory, the connection being represented by various methods to build simplicial complexes from a graph. The methods we consider are the complex of cliques, of independent sets, of neighbours, of enclaveless sets and complexes from acyclic subgraphs, each revealing several properties of the underlying graph. Moreover, we apply the core ideas of persistence theory in the new context of graph theory, we define the persistent block number and the persistent edge-block number.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Dusart, Jérémie. "Graph searches with applications to cocomparability graphs". Paris 7, 2014. http://www.theses.fr/2014PA077048.

Texto completo

Resumen

Un parcours de graphe est un mécanisme pour visiter de manière itérative les sommets d'un graphe. Cela a été une technique fondamentale dans la conception des algorithmes de graphe depuis les débuts de l'informatique. Bon nombre des premiers parcours étaient basées sur le parcours en largeur(BFS) ou en profondeur (DFS) et cela a donné des algorithmes efficaces pour les problèmes pratiques tels que la distance entre deux sommets, le diamètre, la connectivité, les problèmes de flot et la reconnaissance des graphes planaires. Le but de cette thèse est d'étudier les parcours de graphe Dans cette thèse, nous présentons des résultats généraux sur les parcours de graphe dans les graphes de cocomparabilité, mais aussi une nouvelle caractérisation des graphes de cocomparabilité et des applications des parcours de graphe pour résoudre le problème d'orientation transitive, de sous-graphe triangulé maximal, de clique séparatrice et de sommets simpliciaux. Un modèle simple et général est aussi présenté pour capturer la plupart des parcours de graphe
A 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

Los estilos APA, Harvard, Vancouver, ISO, etc.

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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Henry, Tyson Rombauer. "Interactive graph layout: The exploration of large graphs". Diss., The University of Arizona, 1992. http://hdl.handle.net/10150/185833.

Texto completo

Resumen

Directed and undirected graphs provide a natural notation for describing many fundamental structures of computer science. Unfortunately graphs are hard to draw in an easy to read fashion. Traditional graph layout algorithms have focused on creating good layouts for the entire graph. This approach works well with smaller graphs, but often cannot produce readable layouts for large graphs. This dissertation presents a novel methodology for viewing large graphs. The basic concept is to allow the user to interactively navigate through large graphs, learning about them in appropriately small and concise pieces. The motivation of this approach is that large graphs contain too much information to be conveyed by a single canonical layout. For a user to be able to understand the data encoded in the graph she must be able to carve up the graph into manageable pieces and then create custom layouts that match her current interests. An architecture is presented that supports graph exploration. It contains three new concepts for supporting interactive graph layout: interactive decomposition of large graphs, end-user specified layout algorithms, and parameterized layout algorithms. The mechanism for creating custom layout algorithms provides the non-programming end-user with the power to create custom layouts that are well suited for the graph at hand. New layout algorithms are created by combining existing algorithms in a hierarchical structure. This method allows the user to create layouts that accurately reflect the current data set and her current interests. In order to explore a large graph, the user must be able to break the graph into small, more manageable pieces. A methodology is presented that allows the user to apply graph traversal algorithms to large graphs to carve out reasonably sized pieces. Graph traversal algorithms can be combined using a visual programming language. This provides the user with the control to select subgraphs that are of particular interest to her. The ability to Parameterize layout algorithms provides the user with control over the layout process. The user can customize the generated layout by changing parameters to the layout algorithm. Layout algorithm parameterization is placed into an interactive framework that allows the user to iteratively fine tune the generated layout. As a proof of concept, examples are drawn from a working prototype that incorporates this methodology.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Araujo, Julio. "Graph coloring and graph convexity". Nice, 2012. http://www.theses.fr/2012NICE4032.

Texto completo

Resumen

Dans cette thèse, nous étudions plusieurs problèmes de théorie des graphes concernant la coloration et la convexité des graphes. La plupart des résultats figurant ici sont liés à la complexité de calcul de ces problèmes pour certaines classes de graphes. Dans la première, et principale, partie de cette thèse, nous traitons la coloration des graphes qui est l’un des domaines les plus étudiés de théorie des graphes. Nous considérons d’abord trois problèmes de coloration appelés coloration gloutonne, coloration pondérée et coloration pondérée impropre. Ensuite, nous traitons un problème de décision, appelé bon étiquetage d’arêtes, dont la définition a été motivée par le problème d’affectation de longueurs d’onde dans les réseaux optiques. La deuxième partie de cette thèse est consacrée à un paramètre d’optimisation des graphes appelé le nombre enveloppe (géodésique). La définition de ce paramètre est motivée par une extension aux graphes des notions d’ensembles et d’enveloppes convexes dans l’espace Euclidien. Enfin, nous présentons dans l’annexe d’autres travaux développés au cours de cette thèse, l’un sur les hypergraphes orientés Eulériens et Hamiltoniens et l’autre concernant les systèmes de stockage distribués
In 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

Los estilos APA, Harvard, Vancouver, ISO, etc.

Peternek, Fabian Hans Adolf. "Graph compression using graph grammars". Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/31094.

Texto completo

Resumen

This thesis presents work done on compressed graph representations via hyperedge replacement grammars. It comprises two main parts. Firstly the RePair compression scheme, known for strings and trees, is generalized to graphs using graph grammars. Given an object, the scheme produces a small context-free grammar generating the object (called a “straight-line grammar”). The theoretical foundations of this generalization are presented, followed by a description of a prototype implementation. This implementation is then evaluated on real-world and synthetic graphs. The experiments show that several graphs can be compressed stronger by the new method, than by current state-of-the-art approaches. The second part considers algorithmic questions of straight-line graph grammars. Two algorithms are presented to traverse the graph represented by such a grammar. Both algorithms have advantages and disadvantages: the first one works with any grammar but its runtime per traversal step is dependent on the input grammar. The second algorithm only needs constant time per traversal step, but works for a restricted class of grammars and requires quadratic preprocessing time and space. Finally speed-up algorithms are considered. These are algorithms that can decide specific problems in time depending only on the size of the compressed representation, and might thus be faster than a traditional algorithm would on the decompressed structure. The idea of such algorithms is to reuse computation already done for the rules of the grammar. The possible speed-ups achieved this way is proportional to the compression ratio of the grammar. The main results here are a method to answer “regular path queries”, and to decide whether two grammars generate isomorphic trees.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Winerip, Jason. "Graph Linear Complexity". Scholarship @ Claremont, 2008. https://scholarship.claremont.edu/hmc_theses/216.

Texto completo

Resumen

This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and David Neel in their paper "The Linear Complexity of a Graph." It considers additional classes of graphs and provides upper bounds for additional types of graphs and graph operations.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Más fuentes

Libros sobre el tema "Graph"

Golumbic, M. C. Algorithmic graph theory and perfect graphs. 2^a ed. Amsterdam: North Holland, 2004.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Bollobás, Béla. Random graphs. London: Academic Press, 1985.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Kolchin, V. F. Random graphs. Cambridge, UK: Cambridge University Press, 1999.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Random graphs. 2^a ed. Cambridge: Cambridge University Press, 2001.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Random geometric graphs. Oxford: Oxford University Press, 2003.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Bonato, Anthony. The game of cops and robbers on graphs. Providence, R.I: American Mathematical Society, 2011.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Golumbic, Martin Charles. Algorithmic graph theory and perfect graphs. Amsterdam: Elsevier, 2004.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Graph it: Reading charts and graphs. New York: PowerKids Press, 2015.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Graph attack!: Understanding charts and graphs. Englewood Cliffs, NJ: Cambridge Adult Education, 1993.

Buscar texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Bader, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Más fuentes

Capí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 completo

Resumen

Abstract A regular finite graph is called a Ramanujan graph if its zeta function satisfies an analog of the Riemann Hypothesis. Such a graph has a small second eigenvalue so that it is used to construct cryptographic hash functions. Typically, explicit family of Ramanujan graphs are constructed by using Cayley graphs. In the paper, we introduce a generalization of Cayley graphs called generalized group–subgroup pair graphs, which are a generalization of group–subgroup pair graphs defined by Reyes-Bustos. We study basic properties, especially spectra of them.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Corradini, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Kurasov, 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 completo

Resumen

AbstractIn this chapter we start systematic studies of spectral properties of graph Laplacians—standard Laplace operators on metric graphs. Our main interest will be families of metric graphs having the same topological structure. Metric graphs from such a family correspond to the same discrete graph but the lengths of the edges may be different. Common spectral properties of such families (and hence of all metric graphs) are best described by certain multivariate low degree polynomials.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Shekhar, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Hinterberger, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Calì, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Weik, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ramon, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Hinterberger, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Izadkhah, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Actas 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 completo

Resumen

Attributed graph clustering is challenging as it requires joint modelling of graph structures and node attributes. Recent progress on graph convolutional networks has proved that graph convolution is effective in combining structural and content information, and several recent methods based on it have achieved promising clustering performance on some real attributed networks. However, there is limited understanding of how graph convolution affects clustering performance and how to properly use it to optimize performance for different graphs. Existing methods essentially use graph convolution of a fixed and low order that only takes into account neighbours within a few hops of each node, which underutilizes node relations and ignores the diversity of graphs. In this paper, we propose an adaptive graph convolution method for attributed graph clustering that exploits high-order graph convolution to capture global cluster structure and adaptively selects the appropriate order for different graphs. We establish the validity of our method by theoretical analysis and extensive experiments on benchmark datasets. Empirical results show that our method compares favourably with state-of-the-art methods.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Pan, 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 completo

Resumen

Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the reconstruction errors of graph data, but they have mostly ignored the data distribution of the latent codes from the graphs, which often results in inferior embedding in real-world graph data. In this paper, we propose a novel adversarial graph embedding framework for graph data. The framework encodes the topological structure and node content in a graph to a compact representation, on which a decoder is trained to reconstruct the graph structure. Furthermore, the latent representation is enforced to match a prior distribution via an adversarial training scheme. To learn a robust embedding, two variants of adversarial approaches, adversarially regularized graph autoencoder (ARGA) and adversarially regularized variational graph autoencoder (ARVGA), are developed. Experimental studies on real-world graphs validate our design and demonstrate that our algorithms outperform baselines by a wide margin in link prediction, graph clustering, and graph visualization tasks.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Kurapov, 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 completo

Resumen

In this paper, we consider the issues of determining the isomorphism separable graphs. It is shown that for a graph of any kind it is possible apply the methods of diacoptics, that is, divide the set of vertices of the graph into two subsets. The first subset of vertices characterizes non-separable part of the graph and is a non-separable graph. The second subset characterizes the additional part of the graph and consists from certain parts of the graph. The first stage of checking isomorphism consists in checking the isomorphism of non-separable parts of graphs. Then additional parts of the graphs are checked for compliance. If the inseparable part and the complementary parts are isomorphic, then are isomorphic and separable graphs.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Bai, 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 completo

Resumen

We introduce a novel approach to graph-level representation learning, which is to embed an entire graph into a vector space where the embeddings of two graphs preserve their graph-graph proximity. Our approach, UGraphEmb, is a general framework that provides a novel means to performing graph-level embedding in a completely unsupervised and inductive manner. The learned neural network can be considered as a function that receives any graph as input, either seen or unseen in the training set, and transforms it into an embedding. A novel graph-level embedding generation mechanism called Multi-Scale Node Attention (MSNA), is proposed. Experiments on five real graph datasets show that UGraphEmb achieves competitive accuracy in the tasks of graph classification, similarity ranking, and graph visualization.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Hu, 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 completo

Resumen

Learning graph structure for graph neural networks (GNNs) is crucial to facilitate the GNN-based downstream learning tasks. It is challenging due to the non-differentiable discrete graph structure and lack of ground-truth. In this paper, we address these problems and propose a novel graph structure learning framework for GNNs. Firstly, we directly model the continuous graph structure with dual-normalization, which implicitly imposes sparse constraint and reduces the influence of noisy edges. Secondly, we formulate the whole training process as a bilevel programming problem, where the inner objective is to optimize the GNNs given learned graphs, while the outer objective is to optimize the graph structure to minimize the generalization error of downstream task. Moreover, for bilevel optimization, we propose an improved Neumann-IFT algorithm to obtain an approximate solution, which is more stable and accurate than existing optimization methods. Besides, it makes the bilevel optimization process memory-efficient and scalable to large graphs. Experiments on node classification and scene graph generation show that our method can outperform related methods, especially with noisy graphs.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Chen, 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 completo

Resumen

Graph kernels and graph neural networks (GNNs) are widely used for the classification of graph data. However, many existing graph kernels and GNNs have limited expressive power, because they cannot distinguish graphs if the classic 1-dimensional Weisfeiler-Leman (1-WL) algorithm does not distinguish them. To break the 1-WL expressiveness barrier, we propose a novel method called filtration-enhanced graph transformation, which is based on a concept from the area of topological data analysis. In a nutshell, our approach first transforms each original graph into a filtration-enhanced graph based on a certain pre-defined filtration operation, and then uses the transformed graphs as the inputs for graph kernels or GNNs. The striking feature of our approach is that it is a plug-in method and can be applied in any graph kernel and GNN to enhance their expressive power. We theoretically and experimentally demonstrate that our solutions exhibit significantly better performance than the state-of-the art solutions for graph classification tasks.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Nikolentzos, 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 completo

Resumen

The problem of accurately measuring the similarity between graphs is at the core of many applications in a variety of disciplines. Most existing methods for graph similarity focus either on local or on global properties of graphs. However, even if graphs seem very similar from a local or a global perspective, they may exhibit different structure at different scales. In this paper, we present a general framework for graph similarity which takes into account structure at multiple different scales. The proposed framework capitalizes on the well-known k-core decomposition of graphs in order to build a hierarchy of nested subgraphs. We apply the framework to derive variants of four graph kernels, namely graphlet kernel, shortest-path kernel, Weisfeiler-Lehman subtree kernel, and pyramid match graph kernel. The framework is not limited to graph kernels, but can be applied to any graph comparison algorithm. The proposed framework is evaluated on several benchmark datasets for graph classification. In most cases, the core-based kernels achieve significant improvements in terms of classification accuracy over the base kernels, while their time complexity remains very attractive.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Luo, 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 completo

Resumen

Graph representation learning has achieved great success in many areas, including e-commerce, chemistry, biology, etc. However, the fundamental problem of choosing the appropriate dimension of node embedding for a given graph still remains unsolved. The commonly used strategies for Node Embedding Dimension Selection (NEDS) based on grid search or empirical knowledge suffer from heavy computation and poor model performance. In this paper, we revisit NEDS from the perspective of minimum entropy principle. Subsequently, we propose a novel Minimum Graph Entropy (MinGE) algorithm for NEDS with graph data. To be specific, MinGE considers both feature entropy and structure entropy on graphs, which are carefully designed according to the characteristics of the rich information in them. The feature entropy, which assumes the embeddings of adjacent nodes to be more similar, connects node features and link topology on graphs. The structure entropy takes the normalized degree as basic unit to further measure the higher-order structure of graphs. Based on them, we design MinGE to directly calculate the ideal node embedding dimension for any graph. Finally, comprehensive experiments with popular Graph Neural Networks (GNNs) on benchmark datasets demonstrate the effectiveness and generalizability of our proposed MinGE.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Zhao, Wenting, Yuan Fang, Zhen Cui, Tong Zhang y Jian Yang. "Graph Deformer Network". 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/227.

Texto completo

Resumen

Convolution learning on graphs draws increasing attention recently due to its potential applications to a large amount of irregular data. Most graph convolution methods leverage the plain summation/average aggregation to avoid the discrepancy of responses from isomorphic graphs. However, such an extreme collapsing way would result in a structural loss and signal entanglement of nodes, which further cause the degradation of the learning ability. In this paper, we propose a simple yet effective Graph Deformer Network (GDN) to fulfill anisotropic convolution filtering on graphs, analogous to the standard convolution operation on images. Local neighborhood subgraphs (acting like receptive fields) with different structures are deformed into a unified virtual space, coordinated by several anchor nodes. In the deformation process, we transfer components of nodes therein into affinitive anchors by learning their correlations, and build a multi-granularity feature space calibrated with anchors. Anisotropic convolutional kernels can be further performed over the anchor-coordinated space to well encode local variations of receptive fields. By parameterizing anchors and stacking coarsening layers, we build a graph deformer network in an end-to-end fashion. Theoretical analysis indicates its connection to previous work and shows the promising property of graph isomorphism testing. Extensive experiments on widely-used datasets validate the effectiveness of GDN in graph and node classifications.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Jin, Di, Luzhi Wang, Yizhen Zheng, Xiang Li, Fei Jiang, Wei Lin y Shirui Pan. "CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph Similarity Learning". 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/292.

Texto completo

Resumen

Graph similarity learning refers to calculating the similarity score between two graphs, which is required in many realistic applications, such as visual tracking, graph classification, and collaborative filtering. As most of the existing graph neural networks yield effective graph representations of a single graph, little effort has been made for jointly learning two graph representations and calculating their similarity score. In addition, existing unsupervised graph similarity learning methods are mainly clustering-based, which ignores the valuable information embodied in graph pairs. To this end, we propose a contrastive graph matching network (CGMN) for self-supervised graph similarity learning in order to calculate the similarity between any two input graph objects. Specifically, we generate two augmented views for each graph in a pair respectively. Then, we employ two strategies, namely cross-view interaction and cross-graph interaction, for effective node representation learning. The former is resorted to strengthen the consistency of node representations in two views. The latter is utilized to identify node differences between different graphs. Finally, we transform node representations into graph-level representations via pooling operations for graph similarity computation. We have evaluated CGMN on eight real-world datasets, and the experiment results show that the proposed new approach is superior to the state-of-the-art methods in graph similarity learning downstream tasks.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Informes 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Lothian, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Burch, Kimberly Jordan. Chemical Graph Theory. Washington, DC: The MAA Mathematical Sciences Digital Library, agosto de 2008. http://dx.doi.org/10.4169/loci002857.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Maunz, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Phillips, Cynthia A. Parallel Graph Contraction. Fort Belvoir, VA: Defense Technical Information Center, mayo de 1989. http://dx.doi.org/10.21236/ada211916.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Rasmussen, Craig W. Conditional Graph Completions. Fort Belvoir, VA: Defense Technical Information Center, mayo de 1994. http://dx.doi.org/10.21236/ada282914.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Chen, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Parekh, 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 completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Goodman, Eric. Graph Offerings Evaluation. Office of Scientific and Technical Information (OSTI), marzo de 2015. http://dx.doi.org/10.2172/1173145.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Hrebeniuk, 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

Resumen

The planarity of graphs is one of the key sections of graph theory. Although a graph is an abstract mathematical object, most often it is graph visualization that makes it easier to study or develop in a particular area, for example, the infrastructure of a city, a company’s management or a website’s web page. In general, in the form of a graph, it is possible to depict any structures that have connections between the elements. But often such structures grow to such dimensions that it is difficult to determine whether it is possible to represent them on a plane without intersecting the bonds. There are many algorithms that solve this issue. One of these is the gamma method. The article identifies its problems and suggests methods for solving them, and also examines ways to achieve them.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!