Thematische Bibliographien / Simple graph

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Simple graph“

Autor: Grafiati

Veröffentlicht am 18. Mai 2024

Zuletzt aktualisiert am 25. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Simple graph" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Simple graph"

Voorhees, Burton, and Alex Murray. "Fixation probabilities for simple digraphs." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 469, no. 2154 (2013): 20120676. http://dx.doi.org/10.1098/rspa.2012.0676.

Der volle Inhalt der Quelle

Annotation:

The problem of finding birth–death fixation probabilities for configurations of normal and mutants on an N -vertex graph is formulated in terms of a Markov process on the 2 N -dimensional state space of possible configurations. Upper and lower bounds on the fixation probability after any given number of iterations of the birth–death process are derived in terms of the transition matrix of this process. Consideration is then specialized to a family of graphs called circular flows, and we present a summation formula for the complete bipartite graph, giving the fixation probability for an arbitra

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kok, Johan. "Note: Certain bounds in respect of upper deg-centric graphs." Open Journal of Discrete Applied Mathematics 7, no. 2 (2024): 1–6. https://doi.org/10.30538/psrp-odam2024.0097.

Der volle Inhalt der Quelle

Annotation:

This note presents some upper bounds for the size of the upper deg-centric grapg \(G_{ud}\) of a simple connected graph G. Amongst others, a result for graphs for which a compliant graph \(G\) has \(G_{ud} \cong \overline G\) is presented. Finally, results for size minimality in respect upper deg-centrication and minimum size of such graph \(G\) are presented.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

TROTTA, BELINDA. "RESIDUAL PROPERTIES OF SIMPLE GRAPHS." Bulletin of the Australian Mathematical Society 82, no. 3 (2010): 488–504. http://dx.doi.org/10.1017/s0004972710000420.

Der volle Inhalt der Quelle

Annotation:

AbstractClark et al. [‘The axiomatizability of topological prevarieties’, Adv. Math.218 (2008), 1604–1653] have shown that, for k≥2, there exists a Boolean topological graph that is k-colourable but not topologically k-colourable; that is, for every ϵ>0, it cannot be coloured by a paintbrush of width ϵ. We generalize this result to show that, for k≥2, there is a Boolean topological graph that is 2-colourable but not topologically k-colourable. This graph is an inverse limit of finite graphs which are shown to exist by an Erdős-style probabilistic argument of Hell and Nešetřil [‘The core of

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Abughazalah, Nabilah, Naveed Yaqoob, and Asif Bashir. "Cayley Graphs over LA-Groups and LA-Polygroups." Mathematical Problems in Engineering 2021 (May 10, 2021): 1–9. http://dx.doi.org/10.1155/2021/4226232.

Der volle Inhalt der Quelle

Annotation:

The purpose of this paper is the study of simple graphs that are generalized Cayley graphs over LA-polygroups GCLAP − graphs . In this regard, we construct two new extensions for building LA-polygroups. Then, we define Cayley graph over LA-group and GCLAP-graph. Further, we investigate a few properties of them to show that each simple graph of order three, four, and five (except cycle graph of order five which may or may not be a GCLAP-graph) is a GCLAP-graph and then we prove this result.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Amanto, Amanto, Notiragayu Notiragayu, La Zakaria, and Wamiliana Wamiliana. "The relationship of the formulas for the number of connected vertices labeled graphs with order five and order six without loops." Desimal: Jurnal Matematika 4, no. 3 (2021): 357–64. http://dx.doi.org/10.24042/djm.v4i3.10006.

Der volle Inhalt der Quelle

Annotation:

Given a graph with n points and m lines. If each vertex is labeled, then it can be constructed many graphs, connected, or disconnected graphs. A graph G is called a connected graph if there is at least one path that connects a pair of vertices in G. In addition, the graph formed may be simple or not simple. A simple graph is a graph that does not contain loops or parallel lines. A loop is a line that connects a point to itself, and a parallel line is two or more lines that connect the same pair of points. This paper will discuss the relationship between the formula patterns for calculating the

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Alzubaidi, Husniyah, Ljubiša D. R. Kočinac, and Hakeem A. Othman. "On Topologies on Simple Graphs and Their Applications in Radar Chart Methods." Axioms 14, no. 3 (2025): 178. https://doi.org/10.3390/axioms14030178.

Der volle Inhalt der Quelle

Annotation:

This paper introduces a novel topology (upper approximated G-topology) on vertex sets of graphs using rough upper approximation neighborhoods, extending prior work on graph-induced topologies. Key results include characterizing discrete/indiscrete topologies for complete graphs, cycle graphs, and bipartite graphs (Theorems 1–3). The discrete topology for cycle graphs Cn, n>5, is particularly insightful. Exploring further, we delve into the continuity and isomorphism of graph mappings. Subsequently, we apply these findings to enhance radar chart graphical methods through the analysis of corr

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ali, Akbar. "Tetracyclic graphs with maximum second Zagreb index: A simple approach." Asian-European Journal of Mathematics 11, no. 05 (2018): 1850064. http://dx.doi.org/10.1142/s179355711850064x.

Der volle Inhalt der Quelle

Annotation:

In the chemical graph theory, graph invariants are usually referred to as topological indices. The second Zagreb index (denoted by [Formula: see text]) is one of the most studied topological indices. For [Formula: see text], let [Formula: see text] be the collection of all non-isomorphic connected graphs with [Formula: see text] vertices and [Formula: see text] edges (such graphs are known as tetracyclic graphs). Recently, Habibi et al. [Extremal tetracyclic graphs with respect to the first and second Zagreb indices, Trans. on Combin. 5(4) (2016) 35–55.] characterized the graph having maximum

APA, Harvard, Vancouver, ISO und andere Zitierweisen

BAHR, PATRICK. "Convergence in infinitary term graph rewriting systems is simple." Mathematical Structures in Computer Science 28, no. 8 (2018): 1363–414. http://dx.doi.org/10.1017/s0960129518000166.

Der volle Inhalt der Quelle

Annotation:

Term graph rewriting provides a formalism for implementing term rewriting in an efficient manner by emulating duplication via sharing. Infinitary term rewriting has been introduced to study infinite term reduction sequences. Such infinite reductions can be used to model non-strict evaluation. In this paper, we unify term graph rewriting and infinitary term rewriting thereby addressing both components of lazy evaluation: non-strictness and sharing. In contrast to previous attempts to formalise infinitary term graph rewriting, our approach is based on a simple and natural generalisation of the m

APA, Harvard, Vancouver, ISO und andere Zitierweisen

KHEIRABADI, M., and A. R. MOGHADDAMFAR. "RECOGNIZING SOME FINITE SIMPLE GROUPS BY NONCOMMUTING GRAPH." Journal of Algebra and Its Applications 11, no. 04 (2012): 1250077. http://dx.doi.org/10.1142/s0219498812500776.

Der volle Inhalt der Quelle

Annotation:

Let G be a nonabelian group. We define the noncommuting graph ∇(G) of G as follows: its vertex set is G\Z(G), the noncentral elements of G, and two distinct vertices x and y of ∇(G) are joined by an edge if and only if x and y do not commute as elements of G, i.e. [x, y] ≠ 1. The finite group L is said to be recognizable by noncommuting graph if, for every finite group G, ∇(G) ≅ ∇ (L) implies G ≅ L. In the present article, it is shown that the noncommuting graph of a group with trivial center can determine its prime graph. From this, the following theorem is derived. If two finite groups with

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Malik, M. Aslam, and M. Khalid Mahmood. "On Simple Graphs Arising from Exponential Congruences." Journal of Applied Mathematics 2012 (2012): 1–10. http://dx.doi.org/10.1155/2012/292895.

Der volle Inhalt der Quelle

Annotation:

We introduce and investigate a new class of graphs arrived from exponential congruences. For each pair of positive integersaandb, letG(n)denote the graph for whichV={0,1,…,n−1}is the set of vertices and there is an edge betweenaandbif the congruenceax≡b (mod n)is solvable. Letn=p1k1p2k2⋯prkrbe the prime power factorization of an integern, wherep1<p2<⋯<prare distinct primes. The number of nontrivial self-loops of the graphG(n)has been determined and shown to be equal to∏i=1r(ϕ(piki)+1). It is shown that the graphG(n)has2rcomponents. Further, it is proved that the componentΓpof the simp

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Simple graph"

CRUCIANI, EMILIO. "Simple Randomized Distributed Algorithms for Graph Clustering." Doctoral thesis, Gran Sasso Science Institute, 2019. http://hdl.handle.net/20.500.12571/9951.

Der volle Inhalt der Quelle

Annotation:

Label Propagation Algorithms are a class of heuristics for the problem of graph clustering, i.e., the problem of detecting groups of nodes whose connections are dense within each group and sparse between the groups. At the onset, a label is assigned to each node of the graph; then, each node iteratively updates its label according to a function of the labels of its neighbors. Empirical studies show that, after only a few rounds, nodes in the same cluster share the same label while nodes in different clusters have different labels. Although they are widely used in practice given their simplicit

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Matos, Jody Maick Araujo de. "Graph based algorithms to efficiently map VLSI circuits with simple cells." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2018. http://hdl.handle.net/10183/174523.

Der volle Inhalt der Quelle

Annotation:

Essa tese introduz um conjunto de algoritmos baseados em grafos para o mapeamento eficiente de circuitos VLSI com células simples. Os algoritmos propostos se baseiam em minimizar de maneira eficiente o número de elementos lógicos usados na implementação do circuito. Posteriormente, uma quantidade significativa de esforço é aplicada na minimização do número de inversores entre esses elementos lógicos. Por fim, essa representação lógica é mapeada para circuitos compostos somente por células NAND e NOR de duas entradas, juntamente com inversores. Células XOR e XNOR de duas entradas também podem s

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bereczki, Márk. "Graph Neural Networks for Article Recommendation based on Implicit User Feedback and Content." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-300092.

Der volle Inhalt der Quelle

Annotation:

Recommender systems are widely used in websites and applications to help users find relevant content based on their interests. Graph neural networks achieved state- of-the- art results in the field of recommender systems, working on data represented in the form of a graph. However, most graph- based solutions hold challenges regarding computational complexity or the ability to generalize to new users. Therefore, we propose a novel graph- based recommender system, by modifying Simple Graph Convolution, an approach for efficient graph node classification, and add the capability of generalizing t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kaykobad, M. Tanvir. "Transforming Plane Triangulations by Simultaneous Diagonal Flips." Thesis, Université d'Ottawa / University of Ottawa, 2020. http://hdl.handle.net/10393/40499.

Der volle Inhalt der Quelle

Annotation:

We explore the problem of transforming plane triangulations using simultaneous diagonal flips. Wagner showed that any n-vertex plane triangulation can be transformed to any other plane triangulation on equal number of vertices using a finite sequence of diagonal flips. Later on it has been established that O(n) individual flips suffice to complete this transformation. Bose et al. showed that the transformation can also be done in 4 × ( 2 / log 54/53 + 2 / log 6/5 ) logn + 2 ≈ 327.1 log n simultaneous flips. This bound is asymptotically tight. We present two algorithms to improve th

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Islam, Md Kamrul. "Explainable link prediction in large complex graphs - application to drug repurposing." Electronic Thesis or Diss., Université de Lorraine, 2022. http://www.theses.fr/2022LORR0203.

Der volle Inhalt der Quelle

Annotation:

De nombreux systèmes complexes du monde réel peuvent être représentés par des graphes, où les nœuds représentent des entités et les liens des relations entre les paires de nœuds. La prédiction de liens (LP) est l'un des problèmes les plus intéressants et les plus anciens dans le domaine de l'exploration de graphes ; elle prédit la probabilité d'un lien entre deux nœuds non connectés. Cette thèse étudie le problème LP dans les graphes simples et les graphes de connaissances (KGs). La première partie de cette thèse se concentre sur le problème LP dans les graphes simples. Dans la première étude,

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lehbab, Imène. "Problèmes métriques dans les espaces de Grassmann." Electronic Thesis or Diss., Mulhouse, 2023. http://www.theses.fr/2023MULH6508.

Der volle Inhalt der Quelle

Annotation:

Il s'agit d'une contribution dans le domaine de la géométrie métrique du plan projectif complexe CP2 et de la variété de Grassmann réelle des plans dans R6. On s'intéresse à l'étude de tous les p-uplets, p ≥ 3, de droites équiangulaires dans C3 et des p-uplets de plans équi-isoclins dans R6. Sachant que 9 est le nombre maximum de droites équiangulaires que l'on peut construire dans C3, on décrit une méthode qui permet de construire tous les p-uplets de droites équiangulaires pour tout pϵ[3,9]. En particulier, on construit dans C3 cinq classes de congruence de quadruplets de droites équiangulai

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Montanaro, William M. Jr. "Character Degree Graphs of Almost Simple Groups." Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1398345504.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Soames, Kieron, and Jonas Lind. "Detecting Cycles in GraphQL Schemas." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-156174.

Der volle Inhalt der Quelle

Annotation:

GraphQL is a database handling API created by Facebook, that provides an effective al-ternative to REST-style architectures. GraphQL provides the ability for a client to spec-ify exactly what data it wishes to receive. A problem with GraphQL is that the freedomof creating customized requests allows data to be included several times in the response,growing the response’s size exponentially. The thesis contributes to the field of GraphQLanalysis by studying the prevalence of simple cycles in GraphQL schemas. We have im-plemented a locally-run tool and webtool using Tarjan’s and Johnson’s algorit

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yan, Chenyu. "APPROXIMATING DISTANCES IN COMPLICATED GRAPHS BY DISTANCES IN SIMPLE GRAPHS WITH APPLICATIONS." Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1184639623.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Okeke, Nnamdi, and University of Lethbridge Faculty of Arts and Science. "Character generators and graphs for simple lie algebras." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2006, 2006. http://hdl.handle.net/10133/532.

Der volle Inhalt der Quelle

Annotation:

We study character generating functions (character generators) of simple Lie algebras. The expression due to Patera and Sharp, derived from the Weyl character formula, is ¯rst re- viewed. A new general formula is then found. It makes clear the distinct roles of \outside" and \inside" elements of the integrity basis, and helps determine their quadratic incompati- bilities. We review, analyze and extend the results obtained by Gaskell using the Demazure character formulas. We ¯nd that the fundamental generalized-poset graphs underlying the character generators can be deduced from such calculatio

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Simple graph"

Haviar, Miroslav. Vertex labellings of simple graphs. Heldermann Verlag, 2015.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Booth, Bob. Simple use of Cricket Graph for PC Windows. University of Sheffield, Academic Computing Services, 1992.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jerrum, Mark. A very simple algorithm for estimating the numberof k-colourings of a low-degree graph. LFCS, Dept. of Computer Science, University of Edinburgh, 1994.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Praeger, Cheryl E. Low rank representations and graphs for sporadic groups. Cambridge University Press, 1996.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Praeger, Cheryl E. Low rank representations and graphs for sporadic groups. Cambridge University Press, 1997.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dearing, P. M. Boolean and graph theoretic formulation of the simple plant location problem. Naval Postgraduate School, 1987.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

FREEBERG, ERLING, and DOLORES FREEBERG. Simple Graph Art. Teacher Created Resources, 2004.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pancer, Richard Norman. GED - a graph EDitor for labelled simple directed acyclic graphs. 1985.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

BOOK, Modo. Notebook Isometric Graph: Simple Isometric Graph Paper Notebook - 110 Pages. Independently Published, 2021.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

press, isometric. Isometric Graph Paper: Simple Isometric Graph Paper Notebook - 110 Pages. Independently Published, 2021.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Simple graph"

Hougardy, Stefan, and Jens Vygen. "Simple Graph Algorithms." In Algorithmic Mathematics. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-39558-6_7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xiao, Zhenbang, Yu Wang, Shunyu Liu, Huiqiong Wang, Mingli Song, and Tongya Zheng. "Simple Graph Condensation." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-70344-7_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Brandes, Ulrik, and Boris Köpf. "Fast and Simple Horizontal Coordinate Assignment." In Graph Drawing. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45848-4_3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Barth, Wilhelm, Michael Jünger, and Petra Mutzel. "Simple and Efficient Bilayer Cross Counting." In Graph Drawing. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36151-0_13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fairbairn, Jon. "A simple abstract machine to execute supercombinators." In Graph Reduction. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18420-1_49.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mamakani, Khalegh, and Frank Ruskey. "The First Simple Symmetric 11-Venn Diagram." In Graph Drawing. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2_54.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Daescu, Ovidiu, and Jun Luo. "Computing Simple Paths on Points in Simple Polygons." In Computational Geometry and Graph Theory. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89550-3_5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bekos, Michael A., and Chrysanthi N. Raftopoulou. "Circle-Representations of Simple 4-Regular Planar Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2_13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kaugars, Karlis, Juris Reinfelds, and Alvis Brazma. "A simple algorithm for drawing large graphs on small screens." In Graph Drawing. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-58950-3_382.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Forster, Michael. "A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction." In Graph Drawing. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31843-9_22.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Simple graph"

Wang, Haojin, and Kexin Wang. "Simple Structure Enhanced Contrastive Graph clustering." In 2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, 2024. https://doi.org/10.1109/smc54092.2024.10831365.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yu, Nanjun, Qiang Cao, and Zheng Dong. "Simple Adaptive Spectrum Graph Filters for Rumor Detection." In ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2025. https://doi.org/10.1109/icassp49660.2025.10887787.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nguyen, Tran-Ngoc-Linh, Hoang-Ngan Le, Anh-Dung Hoang, et al. "The Masked Simple Graph Contrastive Learning for Recommendation." In 2024 16th International Conference on Knowledge and System Engineering (KSE). IEEE, 2024. https://doi.org/10.1109/kse63888.2024.11063601.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dang, Yu–Hang, Shyam Dhamapurkar, Xiao–Long Zhu, Zheng–Yang Zhou, Hao–Yu Guan, and Xiu–Hao Deng. "Weaving Complex Graph on Simple Low-Dimensional Qubit Lattices." In 2024 International Conference on Quantum Communications, Networking, and Computing (QCNC). IEEE, 2024. http://dx.doi.org/10.1109/qcnc62729.2024.00027.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chushi, Wang, Jia Shiyu, and Ren Xinyue. "Simple Graph Sampling-Based Meta-Learning for Molecular Property Prediction." In 2024 International Conference on Computers, Information Processing and Advanced Education (CIPAE). IEEE, 2024. https://doi.org/10.1109/cipae64326.2024.00099.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Li, Haoyang, and Tianrui Liu. "SimRCOD: Simple Reconstructed and Contrastive learning for Graph Outlier Detection." In 2023 International Conference on Computer, Internet of Things and Smart City (CIoTSC). IEEE, 2023. http://dx.doi.org/10.1109/ciotsc60428.2023.00041.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Junyu, Zhang. "Simple Graph Anomaly Detection via Multi-Scale Contrastive Learning Networks." In 2024 IEEE 6th International Conference on Power, Intelligent Computing and Systems (ICPICS). IEEE, 2024. https://doi.org/10.1109/icpics62053.2024.10796771.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ying, Rui, Mengting Hu, Jianfeng Wu, et al. "Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion." In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.acl-long.596.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Babaei Giglou, Hamed, Niloufar Beyranvand, Reza Moradi, Amir Mohammad Salehoof, and Saeed Bibak. "ParsSimpleQA: The Persian Simple Question Answering Dataset and System over Knowledge Graph." In Proceedings of the 2nd International Workshop on Natural Language Processing for Digital Humanities. Association for Computational Linguistics, 2022. http://dx.doi.org/10.18653/v1/2022.nlp4dh-1.9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wu, Junran, Shangzhe Li, Jianhao Li, Yicheng Pan, and Ke Xu. "A Simple yet Effective Method for Graph Classification." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/497.

Der volle Inhalt der Quelle

Annotation:

In deep neural networks, better results can often be obtained by increasing the complexity of previously developed basic models. However, it is unclear whether there is a way to boost performance by decreasing the complexity of such models. Intuitively, given a problem, a simpler data structure comes with a simpler algorithm. Here, we investigate the feasibility of improving graph classification performance while simplifying the learning process. Inspired by structural entropy on graphs, we transform the data sample from graphs to coding trees, which is a simpler but essential structure for gr

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Simple graph"

Green, Alastair, Paolo Guagliardo, and Leonid Libkin. Property graphs and paths in GQL: Mathematical definitions. Linked Data Benchmark Council, 2021. http://dx.doi.org/10.54285/ldbc.tzjp7279.

Der volle Inhalt der Quelle

Annotation:

This paper provides precise mathematical definitions of a property graph as specified in the proposed GQL international standard, which is an attributed mixed multigraph with loops. It further defines a partially-oriented walk in such a property graph, which is called a path in GQL, as well as restricted classes of such walks (trails, simple/acyclic paths).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Striuk, Andrii, Olena Rybalchenko, and Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], 2020. http://dx.doi.org/10.31812/123456789/4462.

Der volle Inhalt der Quelle

Annotation:

The paper presents an analysis of the importance of studying graph algorithms, the reasons for the need to implement this project and its subsequent use. The existing analogues analysis is carried out, due to which a list of advantages and disadvantages is formed and taken into account in developing the virtual laboratory. A web application is created that clearly illustrates the work of graph algorithms, such as Depth-First Search, Dijkstra’s Shortest Path, Floyd- Warshall, Kruskal Minimum Cost Spanning Tree Algorithm. A simple and user- friendly interface is developed and it is supported by

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bernstetter, Armin. The Digital Lab Book (software). GEOMAR Helmholtz Centre for Ocean Research Kiel, 2024. http://dx.doi.org/10.3289/sw_7_2024.

Der volle Inhalt der Quelle

Annotation:

The Digital Lab Book is a provenance visualization and management tool for immersive and collaborative cisual analytics. It acts as a direct companion to the Virtual Fieldwork Unreal Engine application providing a web-application that tracks interaction in the Unreal Engine. Each interaction in Unreal Engine triggers committing a visualization state to the DLB. The interaction history can be managed similar to a git repository by creating branches and stepping back to previous states in a visualized repository graph. The visualization states can be annotated, and organized in an internal mind-

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Alameda, Joseph. Probability recurrences on simple graphs in a forest building process. Iowa State University, 2019. http://dx.doi.org/10.31274/cc-20240624-1155.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pinzon, Mauricio, and Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 17 : September, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008250.

Der volle Inhalt der Quelle

Annotation:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. The September issue of REVELA reports that growth expectations for 2008 are almost unchanged with

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Galindo, Arturo, and Mauricio Pinzon. Revelation of Expectations in Latin America (REVELA): No. 23 : March, 2009. Inter-American Development Bank, 2009. http://dx.doi.org/10.18235/0008255.

Der volle Inhalt der Quelle

Annotation:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this March issue, REVELA reports that growth expectations for 2009 decreased with respect to l

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Salazni, Mariana, Andrew Powell, Mauricio Pinzon, and Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 16 : August, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008249.

Der volle Inhalt der Quelle

Annotation:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this August issue, REVELA reports that growth expectations for 2008 are almost unchanged with

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pinzon, Mauricio, and Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 21 : January, 2009. Inter-American Development Bank, 2009. http://dx.doi.org/10.18235/0008253.

Der volle Inhalt der Quelle

Annotation:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this January issue, REVELA reports that growth expectations for 2009 decreased with respect to

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pinzon, Mauricio, and Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 20 : December, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008252.

Der volle Inhalt der Quelle

Annotation:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this December issue, REVELA reports that growth expectations for 2008 decreased with respect t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pinzon, Mauricio, and Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 18 : October, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008251.

Der volle Inhalt der Quelle

Annotation:

REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this October issue, REVELA reports that growth expectations for 2008 increased with respect to

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!