Bibliografías temáticas / Open graph

Índice

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

Literatura académica sobre el tema "Open graph"

Autor: Grafiati

Publicado: 4 de junio de 2021

Última modificación: 17 de febrero de 2022

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

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Open 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 "Open graph"

Jose, Bibin K. "Some New Classes of Open Distance-Pattern Uniform Graphs." International Journal of Combinatorics 2013 (July 24, 2013): 1–7. http://dx.doi.org/10.1155/2013/863439.

Texto completo

Resumen

Given an arbitrary nonempty subset M of vertices in a graph G=(V,E), each vertex u in G is associated with the set fMo(u)={d(u,v):v∈M,u≠v} and called its open M-distance-pattern. The graph G is called open distance-pattern uniform (odpu-) graph if there exists a subset M of V(G) such that fMo(u)=fMo(v) for all u,v∈V(G), and M is called an open distance-pattern uniform (odpu-) set of G. The minimum cardinality of an odpu-set in G, if it exists, is called the odpu-number of G and is denoted by od(G). Given some property P, we establish characterization of odpu-graph with property P. In this pape

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

Chandrasekar, K. Raja, and S. Saravanakumar. "OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS." Ural Mathematical Journal 6, no. 2 (2020): 38. http://dx.doi.org/10.15826/umj.2020.2.004.

Texto completo

Resumen

Let $G$ be a graph with the vertex set $V(G)$. A subset $S$ of $V(G)$ is an open packing set of $G$ if every pair of vertices in $S$ has no common neighbor in $G.$ The maximum cardinality of an open packing set of $G$ is the open packing number of $G$ and it is denoted by $\rho^o(G)$. In this paper, the exact values of the open packing numbers for some classes of perfect graphs, such as split graphs, $\{P_4, C_4\}$-free graphs, the complement of a bipartite graph, the trestled graph of a perfect graph are obtained.

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

Dhamala, Tanka Nath. "Some Discrete Optimization Problems With Hamming and H-Comparability Graphs." Tribhuvan University Journal 27, no. 1-2 (2010): 167–76. http://dx.doi.org/10.3126/tuj.v27i1-2.26400.

Texto completo

Resumen

Any H-comparability graph contains a Hamming graph as spanningsubgraph. An acyclic orientation of an H-comparability graph contains an acyclic orientation of the spanning Hamming graph, called sequence graph in the classical open-shop scheduling problem. We formulate different discrete optimization problems on the Hamming graphs and on H-comparability graphs and consider their complexity and relationship. Moreover, we explore the structures of these graphs in the class of irreducible sequences for the open shop problem in this paper.

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

Miklos, Stanislaw. "Reflexive open mappings on generalized graphs." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 47, no. 3 (1989): 343–49. http://dx.doi.org/10.1017/s1446788700033073.

Texto completo

Resumen

AbstractIn this paper we show that a locally connected and locally compact metric image of a generalized graph under a reflexive open mapping is a generalized graph; further, we characterize all acyclic generalized graphs X with the property that any locally one-to-one reflexive open mapping of X into a Hausdorff space is globally one-to-one. Several problems are posed and some examples are given.

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

Gharibyan, Aram H., and Petros A. Petrosyan. "ON LOCALLY-BALANCED 2-PARTITIONS OF BIPARTITE GRAPHS." Proceedings of the YSU A: Physical and Mathematical Sciences 54, no. 3 (253) (2020): 137–45. http://dx.doi.org/10.46991/pysu:a/2020.54.3.137.

Texto completo

Resumen

A \emph{$2$-partition of a graph $G$} is a function $f:V(G)\rightarrow \{0,1\}$. A $2$-partition $f$ of a graph $G$ is a \emph{locally-balanced with an open neighborhood}, if for every $v\in V(G)$, $\left\vert \vert \{u\in N_{G}(v)\colon\,f(u)=0\}\vert - \vert \{u\in N_{G}(v)\colon\,f(u)=1\}\vert \right\vert\leq 1$. A bipartite graph is \emph{$(a,b)$-biregular} if all vertices in one part have degree $a$ and all vertices in the other part have degree $b$. In this paper we prove that the problem of deciding, if a given graph has a locally-balanced $2$-partition with an open neighborhood is $NP$

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

KIYOMI, MASASHI, TOSHIKI SAITOH, and RYUHEI UEHARA. "BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE." Discrete Mathematics, Algorithms and Applications 04, no. 03 (2012): 1250039. http://dx.doi.org/10.1142/s1793830912500395.

Texto completo

Resumen

The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture has been verified for all graphs with at most 11 vertices. Further, the conjecture has been verified for regular graphs, trees, disconnected graphs, unit interval graphs, separable graphs with no pendant vertex, outer-planar graphs, and unicyclic graphs. We extend the list of graph classes for which the conjecture holds. We give a proof that bipartite permutation graphs are reconstructible.

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

ALON, NOGA, and JACOB FOX. "Easily Testable Graph Properties." Combinatorics, Probability and Computing 24, no. 4 (2015): 646–57. http://dx.doi.org/10.1017/s0963548314000765.

Texto completo

Resumen

A graph on n vertices is ε-far from a property $\mathcal{P}$ if one has to add or delete from it at least εn2 edges to get a graph satisfying $\mathcal{P}$. A graph property $\mathcal{P}$ is strongly testable if for every fixed ε > 0 it is possible to distinguish, with one-sided error, between graphs satisfying $\mathcal{P}$ and ones that are ε-far from $\mathcal{P}$ by inspecting the induced subgraph on a random subset of at most f(ε) vertices. A property is easily testable if it is strongly testable and the function f is polynomial in 1/ε, otherwise it is hard. We consider the problem of

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

Kwun, Young Chel, Hafiz Mutee ur Rehman, Muhammad Yousaf, Waqas Nazeer, and Shin Min Kang. "The Entropy of Weighted Graphs with Atomic Bond Connectivity Edge Weights." Discrete Dynamics in Nature and Society 2018 (December 16, 2018): 1–10. http://dx.doi.org/10.1155/2018/8407032.

Texto completo

Resumen

The aim of this report to solve the open problem suggested by Chen et al. We study the graph entropy with ABC edge weights and present bounds of it for connected graphs, regular graphs, complete bipartite graphs, chemical graphs, tree, unicyclic graphs, and star graphs. Moreover, we compute the graph entropy for some families of dendrimers.

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

HUJDUROVIĆ, ADEMIR. "ON SOME PROPERTIES OF QUASI-DISTANCE-BALANCED GRAPHS." Bulletin of the Australian Mathematical Society 97, no. 2 (2018): 177–84. http://dx.doi.org/10.1017/s000497271700096x.

Texto completo

Resumen

For an edge$uv$in a graph$G$,$W_{u,v}^{G}$denotes the set of all vertices of$G$that are closer to$u$than to$v$. A graph$G$is said to bequasi-distance-balancedif there exists a constant$\unicode[STIX]{x1D706}>1$such that$|W_{u,v}^{G}|=\unicode[STIX]{x1D706}^{\pm 1}|W_{v,u}^{G}|$for every pair of adjacent vertices$u$and$v$. The existence of nonbipartite quasi-distance-balanced graphs is an open problem. In this paper we investigate the possible structure of cycles in quasi-distance-balanced graphs and generalise the previously known result that every quasi-distance-balanced graph is triangle-

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

Benediktovich, V. I. "Analogue of Brauer’s conjecture for the signless Laplacian of cographs." Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series 56, no. 3 (2020): 310–17. http://dx.doi.org/10.29235/1561-2430-2020-56-3-310-317.

Texto completo

Resumen

In this paper, we consider the class of cographs and its subclasses, namely, threshold graphs and anti-regular graphs. In 2011 H. Bai confirmed the Grone – Merris conjecture about the sum of the first k eigenvalues of the Laplacian of an arbitrary graph. As a variation of the Grone – Merris conjecture, A. Brouwer put forward his conjecture about an upper bound for this sum. Although the latter conjecture was confirmed for many graph classes, however, it remains open. By analogy to Brouwer’s conjecture, in 2013 F. Ashraf et al. put forward a conjecture about the sum of k eigenvalues of the sign

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

Más fuentes

Tesis sobre el tema "Open graph"

Pereira, Jorge André Henriques. "Leveraging facebook’s open graph to develop an environmental persuasive application." Master's thesis, Faculdade de Ciências e Tecnologia, 2013. http://hdl.handle.net/10362/10998.

Texto completo

Resumen

Dissertação para obtenção do Grau de Mestre em Engenharia Informática<br>Social networking sites persuade millions of users each day to adopt specific behaviors. Using the persuasive principles inherent to these sites to increase environmental awareness and reduce our ecological footprint can be challenging but certainly worthy. The DEAP project has already invested time and resources to address persuasion through different devices for a broad audience. However, there are still many obstacles when it comes to such a delicate subject as people’s routines. For many years, social factors have pr

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

Neumaier, Sebastian, Vadim Savenkov, and Axel Polleres. "Geo-Semantic Labelling of Open Data." Elsevier, 2018. http://epub.wu.ac.at/6632/1/09538259.2018.pdf.

Texto completo

Resumen

In the past years Open Data has become a trend among governments to increase transparency and public engagement by opening up national, regional, and local datasets. However, while many of these datasets come in semi-structured file formats, they use different schemata and lack geo-references or semantically meaningful links and descriptions of the corresponding geo-entities. We aim to address this by detecting and establishing links to geo-entities in the datasets found in Open Data catalogs and their respective metadata descriptions and link them to a knowledge graph of geo-entities. This kn

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

Marlow, Gregory. "Week 06, Video 02: Graph Editor Tangents." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/digital-animation-videos-oer/42.

Texto completo

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

Neumaier, Sebastian, and Axel Polleres. "Enabling Spatio-Temporal Search in Open Data." Department für Informationsverarbeitung und Prozessmanagement, WU Vienna University of Economics and Business, 2018. http://epub.wu.ac.at/6348/1/neumaier2018TR%2Denabling.pdf.

Texto completo

Resumen

Intuitively, most datasets found in Open Data are organised by spatio-temporal scope, that is, single datasets provide data for a certain region, valid for a certain time period. For many use cases (such as for instance data journalism and fact checking) a pre-dominant need is to scope down the relevant datasets to a particular period or region. Therefore, we argue that spatio-temporal search is a crucial need for Open Data portals and across Open Data portals, yet - to the best of our knowledge - no working solution exists. We argue that - just like for for regular Web search - knowledge grap

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

Marlow, Gregory. "Week 10, Video 03: Spoon Graph Editor 1." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/digital-animation-videos-oer/68.

Texto completo

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

Marlow, Gregory. "Week 10, Video 04: Spoon Graph Editor 2." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/digital-animation-videos-oer/69.

Texto completo

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

Auer, Sören. "Von Open Access zu Open Knowledge - wie wir Informationsflüsse der Wissenschaft in der Digitalen Welt organisieren können." Technische Informationsbibliothek TIB, 2019. https://monarch.qucosa.de/id/qucosa%3A35998.

Texto completo

Resumen

Trotz eines verbesserten digitalen Zugangs zu wissenschaftlichen Publikationen in den letzten Jahren bleiben die Grundprinzipien der wissenschaftlichen Kommunikation unverändert und sind weiterhin weitgehend dokumentenbasiert. Die dokumentorientierten Arbeitsabläufe in der Wissenschaft haben die Grenzen der Angemessenheit erreicht, wie die jüngsten Diskussionen über das ungebremste Wachstum wissenschaftlicher Literatur, die Mängel des Peer-Review und die Reproduzierbarkeitskrise zeigen. Open Access ist eine wichtige Voraussetzung diesen Herausforderungen zu begegnen, aber auch nur der erste Sc

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

Marlow, Gregory. "Week 06, Video 05: Altering Animation With Graph Editor." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/digital-animation-videos-oer/45.

Texto completo

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

Manning, Francis Jay. "A Framework for Enforcing Role Based Access Control in Open Source Software." NSUWorks, 2013. http://nsuworks.nova.edu/gscis_etd/228.

Texto completo

Resumen

While Role Based Access Control (RBAC) has been a popular topic of research over the last several years, there are some gaps in the literature that have been waiting to be addressed. One of these gaps involves the application of RBAC to free and open source software (FOSS). With the prevalence of FOSS in most information systems growing rapidly, there is a need to be able to provide a level of confidence that the software will not compromise the data integrity of an environment, nor will it enable the violation of established access controls. Additionally, when utilizing FOSS software it is de

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

Neumaier, Sebastian, and Axel Polleres. "Geo-Semantic Labelling of Open Data. SEMANTiCS 2018-14th International Conference on Semantic Systems." Elsevier, 2018. http://epub.wu.ac.at/6452/1/neum%2Dpoll%2D2018SEMANTiCS.pdf.

Texto completo

Resumen

In the past years Open Data has become a trend among governments to increase transparency and public engagement by opening up national, regional, and local datasets. However, while many of these datasets come in semi-structured file formats, they use di ff erent schemata and lack geo-references or semantically meaningful links and descriptions of the corresponding geo-entities. We aim to address this by detecting and establishing links to geo-entities in the datasets found in Open Data catalogs and their respective metadata descriptions and link them to a knowledge graph of geo-entities

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

Más fuentes

Libros sobre el tema "Open graph"

Varlamov, Oleg. Fundamentals of creating MIVAR expert systems. INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1513119.

Texto completo

Resumen

Methodological and applied issues of the basics of creating knowledge bases and expert systems of logical artificial intelligence are considered. The software package "MIV Expert Systems Designer" (KESMI) Wi!Mi RAZUMATOR" (version 2.1), which is a convenient tool for the development of intelligent information systems. Examples of creating mivar expert systems and several laboratory works are given. The reader, having studied this tutorial, will be able to independently create expert systems based on KESMI.  The textbook in the field of training "Computer Science and Computer Engineering"

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

Varlamov, Oleg. Mivar databases and rules. INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1508665.

Texto completo

Resumen

The multidimensional open epistemological active network MOGAN is the basis for the transition to a qualitatively new level of creating logical artificial intelligence. Mivar databases and rules became the foundation for the creation of MOGAN. The results of the analysis and generalization of data representation structures of various data models are presented: from relational to "Entity — Relationship" (ER-model). On the basis of this generalization, a new model of data and rules is created: the mivar information space "Thing-Property-Relation". The logic-computational processing of data in th

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

Hedetniemi, Stephen T., Ralucca Gera, and Teresa W. Haynes. Graph Theory: Favorite Conjectures and Open Problems - 2. Springer, 2019.

Buscar texto completo

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

Hedetniemi, Stephen, Ralucca Gera, and Craig Larson. Graph Theory: Favorite Conjectures and Open Problems - 1. Springer, 2018.

Buscar texto completo

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

Hedetniemi, Stephen T., Ralucca Gera, and Teresa W. Haynes. Graph Theory: Favorite Conjectures and Open Problems - 2. Springer, 2018.

Buscar texto completo

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

Hedetniemi, Stephen, Ralucca Gera, and Craig Larson. Graph Theory: Favorite Conjectures and Open Problems - 1. Springer, 2016.

Buscar texto completo

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

Watts, Duncan J. Six Degrees: The Science of a Connected Age (Open Market Edition). W. W. Norton & Company, 2004.

Buscar texto completo

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

Watts, Duncan J. Six Degrees: The Science of a Connected Age (Open Market Edition). W. W. Norton & Company, 2004.

Buscar texto completo

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

Gilmartin, Kathleen. Working with Charts, Graphs and Tables (OTT Open Teaching Toolkit). Open University Worldwide, 2001.

Buscar texto completo

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

Nebsm and Linda Carr. Using Graphs (Super Series: Open Learning for Supervisory Management. Tech). Elsevier Science Publishing Company, 1986.

Buscar texto completo

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

Más fuentes

Capítulos de libros sobre el tema "Open graph"

Raitner, Marcus. "Open Problems Wiki." In Graph Drawing. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31843-9_54.

Texto completo

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

Ellson, John, Emden Gansner, Lefteris Koutsofios, Stephen C. North, and Gordon Woodhull. "Graphviz— Open Source Graph Drawing Tools." In Graph Drawing. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45848-4_57.

Texto completo

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

Brandenburg, Franz, David Eppstein, Michael T. Goodrich, Stephen Kobourov, Giuseppe Liotta, and Petra Mutzel. "Selected Open Problems in Graph Drawing." In Graph Drawing. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24595-7_55.

Texto completo

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

Albrecht, Mario, Andreas Kerren, Karsten Klein, et al. "On Open Problems in Biological Network Visualization." In Graph Drawing. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11805-0_25.

Texto completo

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

Xu, Kexiang, Kinkar Ch Das, and Nenad Trinajstić. "Open Problems." In The Harary Index of a Graph. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-45843-3_6.

Texto completo

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

Bachmaier, Christian, Franz Josef Brandenburg, Philip Effinger, et al. "The Open Graph Archive: A Community-Driven Effort." In Graph Drawing. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25878-7_42.

Texto completo

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

Xu, Xiaodong, and Stanisław P. Radziszowski. "On Some Open Questions for Ramsey and Folkman Numbers." In Graph Theory. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-31940-7_4.

Texto completo

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

Hedetniemi, Stephen T. "My Top 10 Graph Theory Conjectures and Open Problems." In Graph Theory. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-31940-7_8.

Texto completo

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

Alamdari, Soroush, and Therese Biedl. "Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2_10.

Texto completo

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

Alamdari, Soroush, and Therese Biedl. "Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames." In Graph Drawing. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25878-7_3.

Texto completo

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

Actas de conferencias sobre el tema "Open graph"

Jaradeh, Mohamad Yaser, Allard Oelen, Kheir Eddine Farfar, et al. "Open Research Knowledge Graph." In K-CAP '19: Knowledge Capture Conference. ACM, 2019. http://dx.doi.org/10.1145/3360901.3364435.

Texto completo

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

Gupta, Swapnil, Sreyash Kenkre, and Partha Talukdar. "CaRe: Open Knowledge Graph Embeddings." In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). Association for Computational Linguistics, 2019. http://dx.doi.org/10.18653/v1/d19-1036.

Texto completo

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

Wu, Man, Shirui Pan, and Xingquan Zhu. "OpenWGL: Open-World Graph Learning." In 2020 IEEE International Conference on Data Mining (ICDM). IEEE, 2020. http://dx.doi.org/10.1109/icdm50108.2020.00077.

Texto completo

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

Andersen, Jakob Smedegaard, and Olaf Zukunft. "Evaluating the Scaling of Graph-Algorithms for Big Data Using GraphX." In 2016 2nd International Conference on Open and Big Data (OBD). IEEE, 2016. http://dx.doi.org/10.1109/obd.2016.8.

Texto completo

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

Hussin, Burairah, Abd Samad Hasan Basari, Abdul Samad Shibghatullah, Siti Azirah Asmai, and Norwahida Syazwani Othman. "Exam timetabling using graph colouring approach." In 2011 IEEE Conference on Open Systems (ICOS). IEEE, 2011. http://dx.doi.org/10.1109/icos.2011.6079274.

Texto completo

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

Mikhailov, Andrey, Alexey Shigarov, Egor Rozhkov, and Igor Cherepanov. "On Graph-Based Verification for PDF Table Detection." In 2020 Ivannikov Ispras Open Conference (ISPRAS). IEEE, 2020. http://dx.doi.org/10.1109/ispras51486.2020.00020.

Texto completo

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

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

Texto completo

Resumen

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

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

Antoniazzi, Francesco, and Fabio Viola. "RDF Graph Visualization Tools: a Survey." In 2018 23rd Conference of Open Innovations Association (FRUCT). IEEE, 2018. http://dx.doi.org/10.23919/fruct.2018.8588069.

Texto completo

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

Wei, Xing, and Jiangjiang Liu. "Effects of Nonlinear Functions on Knowledge Graph Convolutional Networks for Recommender Systems with Yelp Knowledge Graph." In 11th International Conference on Computer Science and Information Technology (CCSIT 2021). AIRCC Publishing Corporation, 2021. http://dx.doi.org/10.5121/csit.2021.110715.

Texto completo

Resumen

Knowledge Graph (KG) related recommendation method is advanced in dealing with cold start problems and sparse data. Knowledge Graph Convolutional Network (KGCN) is an end-to-end framework that has been proved to have the ability to capture latent item-entity features by mining their associated attributes on the KG. In KGCN, aggregator plays a key role for extracting information from the high-order structure. In this work, we proposed Knowledge Graph Processor (KGP) for pre-processing data and building corresponding knowledge graphs. A knowledge graph for the Yelp Open dataset was constructed w

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

El-Gayyar, M. S., H. M. El-Eashy, and M. Zaki. "Structural Synthesis and Enumeration of Epicyclic Gear Mechanisms Up to 12-Links Using Acyclic Graph Method." In ASME Turbo Expo 2006: Power for Land, Sea, and Air. ASMEDC, 2006. http://dx.doi.org/10.1115/gt2006-91136.

Texto completo

Resumen

In this paper, a new approach for graphical enumeration of epicyclic gear mechanisms is presented using the concept of acyclic graph. A new graphical code has been introduced to specify the priorities of all vertices of associated displacement graph. This graphical code is used to identify open graph, redundant links and isomorphic graphs. A computer program has been developed for automatic enumeration of displacement graphs as well as automatic detection of isomorphic graphs and open graphs and graphs with a redundant link without using adjacency matrices. This simplified methodology has been

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

Informes sobre el tema "Open graph"

Henderson, Keith. OPEX: Optimized Eccentricity Computation in Graphs. Office of Scientific and Technical Information (OSTI), 2011. http://dx.doi.org/10.2172/1113361.

Texto completo

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!