Thematische Bibliographien / Graphe simple

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Graphe simple“

Autor: Grafiati
Veröffentlicht am 18. Mai 2024
Zuletzt aktualisiert am 8. Juni 2024

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 "Graphe simple" 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 "Graphe simple"

1

Hudry, Olivier. "Application of the “descent with mutations” metaheuristic to a clique partitioning problem." RAIRO - Operations Research 53, no. 3 (2019): 1083–95. http://dx.doi.org/10.1051/ro/2018048.

Der volle Inhalt der Quelle
Annotation:
We study here the application of the “descent with mutations” metaheuristic to a problem arising from the field of classification and cluster analysis (dealing more precisely with the aggregation of symmetric relations) and which can be represented as a clique partitioning of a weighted graph. In this problem, we deai with a complete undirected graphe G; the edges of G have weights which can be positive, negative or equal to 0; the aim is to partition the vertices of G into disjoint cliques (whose number depends on G in order to minimize the sum of the weights of the edges with their two extre
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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
3

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
4

Azari, M., and A. Iranmanesh. "On the edge-Wiener index of the disjunctive product of simple graphs." Algebra and Discrete Mathematics 30, no. 1 (2020): 1–14. http://dx.doi.org/10.12958/adm242.

Der volle Inhalt der Quelle
Annotation:
The edge-Wiener index of a simple connected graph G is defined as the sum of distances between all pairs of edges of G where the distance between two edges in G is the distance between the corresponding vertices in the line graph of G. In this paper, we study the edge-Wiener index under the disjunctive product of graphs and apply our results to compute the edge-Wiener index for the disjunctive product of paths and cycles.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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
6

Vasanthi, R., and K. Subramanian. "On Vertex Covering Transversal Domination Number of Regular Graphs." Scientific World Journal 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/1029024.

Der volle Inhalt der Quelle
Annotation:
A simple graphG=(V,E)is said to ber-regular if each vertex ofGis of degreer. The vertex covering transversal domination numberγvct(G)is the minimum cardinality among all vertex covering transversal dominating sets ofG. In this paper, we analyse this parameter on different kinds of regular graphs especially forQnandH3,n. Also we provide an upper bound forγvctof a connected cubic graph of ordern≥8. Then we try to provide a more stronger relationship betweenγandγvct.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Voorhees, Burton, and Bergerud Ryder. "Simple graph models of information spread in finite populations." Royal Society Open Science 2, no. 5 (2015): 150028. http://dx.doi.org/10.1098/rsos.150028.

Der volle Inhalt der Quelle
Annotation:
We consider several classes of simple graphs as potential models for information diffusion in a structured population. These include biases cycles, dual circular flows, partial bipartite graphs and what we call ‘single-link’ graphs. In addition to fixation probabilities, we study structure parameters for these graphs, including eigenvalues of the Laplacian, conductances, communicability and expected hitting times. In several cases, values of these parameters are related, most strongly so for partial bipartite graphs. A measure of directional bias in cycles and circular flows arises from the no
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

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
9

Devriendt, Karel, and Piet Van Mieghem. "The simplex geometry of graphs." Journal of Complex Networks 7, no. 4 (2019): 469–90. http://dx.doi.org/10.1093/comnet/cny036.

Der volle Inhalt der Quelle
Annotation:
AbstractGraphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods, each of which highlights the properties of graphs in a unique way. Here, we discuss a novel approach to study graphs: the simplex geometry (a simplex is a generalized triangle). This perspective, proposed by Miroslav Fiedler, introduces techniques from (simplex) geometry into the field of graph theory and conversely, via an exact correspondence. We in
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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

Dissertationen zum Thema "Graphe simple"

1

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
2

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
3

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
4

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
5

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
6

Kimmel, Jason. "Simple Games on Networks." Oberlin College Honors Theses / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1307994412.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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
8

Everett, Alistaire Duncan Fraser. "Commuting involution graphs of certain finite simple classical groups." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/commuting-involution-graphs-of-certain-finite-simple-classical-groups(dd54ee3d-8c94-42cd-87e1-d34770756466).html.

Der volle Inhalt der Quelle
Annotation:
For a group G and X a subset of G, the commuting graph of G on X, denoted by C(G,X), is the graph whose vertex set is X with x, y joined by an edge if x not equal to y and x and y commute. If the elements in X are involutions, then C(G,X) is called a commuting involution graph. This thesis studies C(G,X) when G is either a 4-dimensional projective symplectic group; a 3-dimensional unitary group; 4-dimensional unitary group over a field of characteristic 2; a 2-dimensional projective general linear group; or a 4-dimensional affne orthogonal group, and X a G-conjugacy class of involutions. We de
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Bosi, Gianluca <1991&gt. "Simple random walks on some partially directed planar graphs." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amsdottorato.unibo.it/8914/1/bosi_gianluca_tesi.pdf.

Der volle Inhalt der Quelle
Annotation:
In this thesis we analyze the recurrence behavior of simple random walks on some classes of directed planar graphs. Our first model is a version of the honeycomb lattice, where the horizontal edges are randomly oriented according to families of random variables: depending on their distribution, we prove a.s. transience in some cases, and a.s. recurrence in other ones. Our results extend those obtained by Campanino and Petritis (’03 and ’14) for partially oriented square grid lattices. Furthermore, we consider two directed square grid lattices on which, because of the direction imposed by the
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Mahfoudh, Mariem. "Adaptation d'ontologies avec les grammaires de graphes typés : évolution et fusion." Thesis, Mulhouse, 2015. http://www.theses.fr/2015MULH1519/document.

Der volle Inhalt der Quelle
Annotation:
Étant une représentation formelle et explicite des connaissances d'un domaine, les ontologies font régulièrement l'objet de nombreux changements et ont ainsi besoin d'être constamment adaptées pour notamment pouvoir être réutilisées et répondre aux nouveaux besoins. Leur réutilisation peut prendre différentes formes (évolution, alignement, fusion, etc.), et présente plusieurs verrous scientifiques. L'un des plus importants est la préservation de la consistance de l'ontologie lors de son changement. Afin d'y répondre, nous nous intéressons dans cette thèse à étudier les changements ontologiques
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Graphe simple"

1

Simple gospel, simply grace. Harvest House Publishers, 2015.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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
4

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
5

Zörnig, Peter. Degeneracy Graphs and Simplex Cycling. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-45702-9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Zörnig, Peter. Degeneracy graphs and simplex cycling. Springer-Verlag, 1991.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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
8

ill, Sandoval Rafa, ed. The simple life. Spotlight, 2009.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Galloway, Gregory. As simple as snow. Berkley Books, 2006.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Skrobol, Sebastian. Quiet little Melody: A simple fairytale. Prószyński Media, 2014.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Graphe simple"

1

Aubert, J. P., J. F. Baget, and M. Chein. "Simple Conceptual Graphs and Simple Concept Graphs." In Conceptual Structures: Inspiration and Application. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11787181_7.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Andersen, H. H., M. Højbjerre, D. Sørensen, and P. S. Eriksen. "Simple Undirected Graphs." In Linear and Graphical Models. Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4240-6_5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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
4

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
5

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
6

Dai, Qionghai, and Yue Gao. "Mathematical Foundations of Hypergraph." In Artificial Intelligence: Foundations, Theory, and Algorithms. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-0185-2_2.

Der volle Inhalt der Quelle
Annotation:
AbstractIn this chapter, we introduce the mathematical foundations of hypergraph and present the mathematical notations that are used to facilitate deep understanding and analysis of hypergraph structure. A hypergraph is composed of a set of vertices and hyperedges, and it is a generalization of a graph, where a weighted hypergraph quantifies the relative importance of hyperedges or vertices. Hypergraph can also be divided into two main categories, i.e., the undirected hypergraph representation and the directed hypergraph representation. The latter one further divides the vertices in one hyperedge into the source vertex set and the target vertex set to model more complex correlations. Additionally, we discuss the relationship between hypergraph and graph from the perspective of structural transformation and expressive ability. The most intuitive difference between a simple graph and a hypergraph can be observed in the size of order and expression of adjacency. A hypergraph can be converted into a simple graph using clique expansion, star expansion, and line expansion. Moreover, the proof based on random walks and Markov chains establishes the relationship between hypergraphs with edge-independent vertex weights and weighted graphs.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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
8

Waltham, David. "More about graphs." In Mathematics: A Simple Tool for Geologists. Springer US, 1994. http://dx.doi.org/10.1007/978-1-4899-4479-5_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Chiaselotti, Giampiero, Davide Ciucci, Tommaso Gentile, and Federico Infusino. "Preclusivity and Simple Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25783-9_12.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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

Konferenzberichte zum Thema "Graphe simple"

1

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
2

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.

Der volle Inhalt der Quelle
Annotation:
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
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Bei, Xiaohui, Youming Qiao, and Shengyu Zhang. "Networked Fairness in Cake Cutting." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/508.

Der volle Inhalt der Quelle
Annotation:
We introduce a graphical framework for fair division in cake cutting, where comparisons between agents are limited by an underlying network structure. We generalize the classical fairness notions of envy-freeness and proportionality in this graphical setting. An allocation is called envy-free on a graph if no agent envies any of her neighbor's share, and is called proportional on a graph if every agent values her own share no less than the average among her neighbors, with respect to her own measure. These generalizations enable new research directions in developing simple and efficient algori
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Wang, Huijuan, Siming Dai, Weiyue Su, et al. "Simple and Effective Relation-based Embedding Propagation for Knowledge Representation Learning." 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/382.

Der volle Inhalt der Quelle
Annotation:
Relational graph neural networks have garnered particular attention to encode graph context in knowledge graphs (KGs). Although they achieved competitive performance on small KGs, how to efficiently and effectively utilize graph context for large KGs remains an open problem. To this end, we propose the Relation-based Embedding Propagation (REP) method. It is a post-processing technique to adapt pre-trained KG embeddings with graph context. As relations in KGs are directional, we model the incoming head context and the outgoing tail context separately. Accordingly, we design relational context
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Ding, Huafeng, Jing Zhao, and Zhen Huang. "The Establishment of Novel Structure Representation Models for Several Kinds of Mechanisms." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-86074.

Der volle Inhalt der Quelle
Annotation:
This paper attempts to establish the unified topological models and corresponding mathematical representations for planar simple joint, multiple joint and geared (cam) kinematic chains. First, the conventional topological representation models of kinematic chains are introduced. Then new topological models of multiple joint and geared (cam) kinematic chains, which are derived from the topological graph of simple joint kinematic chains, are presented. The characteristics of the new topological graphs and their associations with the topological graph of simple joint kinematic chains are also add
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Li, Pengyong, Jun Wang, Ziliang Li, et al. "Pairwise Half-graph Discrimination: A Simple Graph-level Self-supervised Strategy for Pre-training Graph Neural Networks." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/371.

Der volle Inhalt der Quelle
Annotation:
Self-supervised learning has gradually emerged as a powerful technique for graph representation learning. However, transferable, generalizable, and robust representation learning on graph data still remains a challenge for pre-training graph neural networks. In this paper, we propose a simple and effective self-supervised pre-training strategy, named Pairwise Half-graph Discrimination (PHD), that explicitly pre-trains a graph neural network at graph-level. PHD is designed as a simple binary classification task to discriminate whether two half-graphs come from the same source. Experiments demon
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Parmacli, Dmitrii, and Serghei Cara. "Evaluating the dynamics of grape production in UTA Gagauzia." In The 8th International Conference "Management Strategies and Policies in the Contemporary Economy". Academy of Economic Studies of Moldova, 2023. http://dx.doi.org/10.53486/icspm2023.10.

Der volle Inhalt der Quelle
Annotation:
It is emphasized that viticulture in ATU Gagauzia is the most promising sector in agricultural production. An assessment of the dynamics of grape production in the autonomy makes it possible to determine the level of development of the industry, to reveal, to a certain extent, the existing shortcomings and to determine the ways of development. The purpose of the study is to propose a methodology for assessing the state of the dynamics of grape production, confirming its features on specific examples from practice. The object of the study are farms of all categories of ATU Gagauzia for 2012-202
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Campos, Raphael R., Ricardo Ferreira, Julio C. Goldner Vendramini, Fábio Cerqueira, and Marcelo Lobato Martins. "Simulation of Scale Free Gene Regulatory Networks based on Threshold Functions on GPU." In Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2011. http://dx.doi.org/10.5753/wscad.2011.17271.

Der volle Inhalt der Quelle
Annotation:
Gene regulatory networks have been used to study diseases and cell evolution, where Random Boolean graphs are one of computational approaches. A Boolean graph is a simple and effective model, and its dynamic behavior has been used in several works. This article proposes an efficient environment to simulate Boolean graph on GPU (Graphics Processing Units). The dynamic behavior of a Boolean graph is computed by visiting the whole or a subset of state space. The proposed tool is based on statistical approaches to evaluate large graphs. Moreover, it can take into account scale free graphs with thr
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Klobas, Nina, and Matjaž Krnc. "Fast Recognition of Some Parametric Graph Families." In 7th Student Computer Science Research Conference. University of Maribor Press, 2021. http://dx.doi.org/10.18690/978-961-286-516-0.7.

Der volle Inhalt der Quelle
Annotation:
Recognizing graphs with high level of symmetries is hard in general, and usually requires additional structural understanding. In this paper we study a particular graph parameter and motivate its usage by devising eÿcient recognition algorithm for the family of I-graphs. For integers m a simple graph is cycle regular if every path of length ` belongs to exactly cycles of length m. We identify all cycle regular I-graphs and, as a conse-quence, describe linear recognition algorithm for the observed family. Similar procedure can be used to devise the recog-nition algorithms for Double generalized
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Ding, Huafeng, Peng Huang, Zhen Huang, and Andrés Kecskeméthy. "An Automatic Method for Sketching of Planar Simple and Multiple Joint Kinematic Chains." In ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-47216.

Der volle Inhalt der Quelle
Annotation:
The sketching of mechanisms (kinematic chains) shows designers a visual understanding of the interrelationship among links and joints in mechanical design, but sketching of mechanisms in manually in conceptual design stage is time-consuming and inefficient. In this paper, a fully-automatic method for sketching of planar simple and multiple joint kinematic chains is proposed. First, the complete sets of the topological structures (topological graphs and contracted graphs) of both simple and multiple joint kinematic chains are introduced. Then an algorithm for the layouts of the contracted graph
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Graphe simple"

1

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
2

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
3

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
4

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
5

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
6

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
7

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
8

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

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 February issue, REVELA reports that growth expectations for 2009 decreased with respect t
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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
10

Lichter, Amnon, Joseph L. Smilanick, Dennis A. Margosan, and Susan Lurie. Ethanol for postharvest decay control of table grapes: application and mode of action. United States Department of Agriculture, 2005. http://dx.doi.org/10.32747/2005.7587217.bard.

Der volle Inhalt der Quelle
Annotation:
Original objectives: Dipping of table grapes in ethanol was determined to be an effective measure to control postharvest gray mold infection caused by Botrytis cinerea. Our objectives were to study the effects of ethanol on B.cinerea and table grapes and to conduct research that will facilitate the implementation of this treatment. Background: Botrytis cinerea is known as the major pathogen of table grapes in cold storage. To date, the only commercial technology to control it relied on sulfur dioxide (SO₂) implemented by either fumigation of storage facilities or from slow release generator pa
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!

Zur Bibliographie