Log in

Relevant bibliographies by topics / Berge

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Berge'

Author: Grafiati

Published: 4 June 2021

Last updated: 27 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Berge.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Berge"

1

Hvidt, Niels Christian. "Glaube versetzt Berge – Berge versetzen Glauben." Spiritual Care 6, no. 2 (April 1, 2017): 237–40. http://dx.doi.org/10.1515/spircare-2016-0174.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kudryavtsev, Konstantin, and Ustav Malkov. "Weak Berge Equilibrium in Finite Three-person Games: Conception and Computation." Open Computer Science 11, no. 1 (December 17, 2020): 127–34. http://dx.doi.org/10.1515/comp-2020-0210.

Full text

Abstract:

AbstractThe paper proposes the concept of a weak Berge equilibrium. Unlike the Berge equilibrium, the moral basis of this equilibrium is the Hippocratic Oath “First do no harm”. On the other hand, any Berge equilibrium is a weak Berge equilibrium. But, there are weak Berge equilibria, which are not the Berge equilibria. The properties of the weak Berge equilibrium have been investigated. The existence of the weak Berge equilibrium in mixed strategies has been established for finite games. The weak Berge equilibria for finite three-person non-cooperative games are computed.

APA, Harvard, Vancouver, ISO, and other styles

3

Enkhbat, R. "A Note on Anti-Berge Equilibrium for Bimatrix Game." Bulletin of Irkutsk State University. Series Mathematics 36 (2021): 3–13. http://dx.doi.org/10.26516/1997-7670.2021.36.3.

Full text

Abstract:

Game theory plays an important role in applied mathematics, economics and decision theory. There are many works devoted to game theory. Most of them deals with a Nash equilibrium. A global search algorithm for finding a Nash equilibrium was proposed in [13]. Also, the extraproximal and extragradient algorithms for the Nash equilibrium have been discussed in [3]. Berge equilibrium is a model of cooperation in social dilemmas, including the Prisoner’s Dilemma games [15]. The Berge equilibrium concept was introduced by the French mathematician Claude Berge [5] for coalition games. The first research works of Berge equilibrium were conducted by Vaisman and Zhukovskiy [18; 19]. A method for constructing a Berge equilibrium which is Pareto-maximal with respect to all other Berge equilibriums has been examined in Zhukovskiy [10]. Also, the equilibrium was studied in [16] from a view point of differential games. Abalo and Kostreva [1; 2] proved the existence theorems for pure-strategy Berge equilibrium in strategic-form games of differential games. Nessah [11] and Larbani, Tazdait [12] provided with a new existence theorem. Applications of Berge equilibrium in social science have been discussed in [6; 17]. Also, the work [7] deals with an application of Berge equilibrium in economics. Connection of Nash and Berge equilibriums has been shown in [17]. Most recently, the Berge equilibrium was examined in Enkhbat and Batbileg [14] for Bimatrix game with its nonconvex optimization reduction. In this paper, inspired by Nash and Berge equilibriums, we introduce a new notion of equilibrium so-called Anti-Berge equilibrium. The main goal of this paper is to examine Anti-Berge equilibrium for bimatrix game. The work is organized as follows. Section 2 is devoted to the existence of Anti-Berge equilibrium in a bimatrix game for mixed strategies. In Section 3, an optimization formulation of Anti-Berge equilibrium has been formulated.

APA, Harvard, Vancouver, ISO, and other styles

4

Kjeldstadli, Knut. "Berge Furre." Arbeiderhistorie 1, no. 01 (March 28, 2017): 141–42. http://dx.doi.org/10.18261/issn.2387-5879-2017-01-09.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Newman, Laura. "BERGE MINASSIAN." Neurology Today &NA; (April 2006): 6–7. http://dx.doi.org/10.1097/01.nt.0000282445.16401.9c.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Chudnovsky, Maria. "Berge trigraphs." Journal of Graph Theory 53, no. 1 (2006): 1–55. http://dx.doi.org/10.1002/jgt.20165.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Janssen, P., P. Cavaillé, A. Vivier, and A. Evette. "Le génie végétal favorise une plus grande diversité de micro-habitats aquatiques et de macro-invertébrés benthiques." Techniques Sciences Méthodes, no. 9 (September 2019): 55–64. http://dx.doi.org/10.1051/tsm/201909055.

Full text

Abstract:

Le génie végétal est une alternative écologique au génie civil pour contrôler l’érosion des berges des cours d’eau.Vial’introduction active de végétaux vivants, ces techniques d’ingénierie peuvent également faciliter ou accélérer la restauration écologique des zones riveraines en i) améliorant la qualité de l’habitat riverain et en ii) favorisant une recolonisation de la partie émergée et immergée de la berge par des espèces cibles. Notre étude vise à caractériser comment différentes techniques de stabilisation des berges, d’âges différents, influencent la diversité et la composition des micro-habitats aquatiques et des macro-invertébrés benthiques associés. Au total, 37 berges ont été échantillonnées et hiérarchisées selon un indice de qualité de l’habitat riverain croisant le type et l’âge des ouvrages et représentant un gradient de végétalisation croissant de la berge. Nos résultats montrent que la richesse et le potentiel d’habitabilité des micro-habitats aquatiques augmentent significativement avec la qualité de l’habitat riverain. Spécifiquement, le génie végétal permet une meilleure représentation de micro-habitats à forts potentiels biogènes, comme c’est le cas des systèmes racinaires immergés. Cette augmentation de la qualité de l’habitat aquatique se traduit par une plus grande diversité taxinomique de macro-invertébrés benthiques au niveau des berges stabilisées par les techniques de génie végétal. Pris dans leur ensemble, nos résultats pointent la plus-value du génie végétal pour la restauration écologique des compartiments terrestre et aquatique des berges dégradées.

APA, Harvard, Vancouver, ISO, and other styles

8

Harambourg, Lydia. "Louis-René Berge." Nouvelles de l'estampe, no. 236 (September 1, 2011): 72–75. http://dx.doi.org/10.4000/estampe.1139.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Peskoller, Helga. "Berge, Menschen, Meere." Paragrana 24, no. 1 (August 1, 2015): 39–50. http://dx.doi.org/10.1515/para-2015-0004.

Full text

Abstract:

Abstract Der Beitrag geht anhand von zwei Beispielen - Achttausender im Himalaya überschreiten und Weltmeere gegen den Wind umsegeln - der Frage nach, was es mit dieser großen Sehnsucht nach dem wilden Leben auf sich hat, die nicht nur wenige Grenzgänger, sondern auch viele Alltagsmenschen zu erfassen scheint, und erinnert im Nachgang des Erlebten Konzepte von Abenteuer, Freiheit, Risiko und Natur.

APA, Harvard, Vancouver, ISO, and other styles

10

Söring, Jürgen. "Dichtung und Berge." KulturPoetik 19, no. 2 (September 24, 2019): 205–21. http://dx.doi.org/10.13109/kult.2019.19.2.205.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Berge"

1

Müller-Kelwing, Karin. "Rudolf Berge." Böhlau Verlag, 2020. https://slub.qucosa.de/id/qucosa%3A75031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Trunck, Théophile. "Trigraphes de Berge apprivoisés." Thesis, Lyon, École normale supérieure, 2014. http://www.theses.fr/2014ENSL0929/document.

Full text

Abstract:

L'objectif de cette thèse est de réussir à utiliser des décompositions de graphes afin de résoudre des problèmes algorithmiques sur les graphes. Notre objet d'étude principal est la classe des graphes de Berge apprivoisés. Les graphes de Berge sont les graphes ne possédant ni cycle de longueur impaire supérieur à 4 ni complémentaire de cycle de longueur impaire supérieure à 4. Dans les années 60, Claude Berge a conjecturé que les graphes de Berge étaient des graphes parfaits. C'est-à-dire que la taille de la plus grande clique est exactement le nombre minimum de couleurs nécessaire à une coloration propre et ce pour tout sous-graphe. En 2002, Chudnovsky, Robertson, Seymour et Thomas ont démontré cette conjecture en utilisant un théorème de structure: les graphes de Berge sont basiques ou admettent une décomposition. Ce résultat est très utile pour faire des preuves par induction. Cependant, une des décompositions du théorème, la skew-partition équilibrée, est très difficile à utiliser algorithmiquement. Nous nous focalisons donc sur les graphes de Berge apprivoisés, c'est-à-dire les graphes de Berge sans skew-partition équilibrée. Pour pouvoir faire des inductions, nous devons adapter le théorème destructure de Chudnovsky et al à notre classe. Nous prouvons un résultat plus fort: les graphes de Berge apprivoisés sont basiques ou admettent une décomposition telle qu'un côté de la décomposition soit toujours basique. Nous avons de plus un algorithme calculant cette décomposition. Nous utilisons ensuite notre théorème pour montrer que les graphes de Berge apprivoisés admettent la propriété du grand biparti, de la clique-stable séparation et qu'il existe un algorithme polynomial permettant de calculer le stable maximum
The goal of this these is to use graph's decompositions to solve algorithmic problems on graphs. We will study the class of Berge tame graphs. A Berge graph is a graph without cycle of odd length at least 4 nor complement of cycle of odd length at least 4.In the 60's, Claude Berge conjectured that Berge graphs are perfect graphs. The size of the biggest clique is exactly the number of colors required to color the graph. In 2002, Chudnovsky, Robertson, Seymour et Thomas proved this conjecture using a theorem of decomposition: Berge graphs are either basic or have a decomposition. This is a useful result to do proof by induction. Unfortunately, one of the decomposition, the skew-partition, is really hard to use. We arefocusing here on Berge tame graphs, i.e~Berge graph without balanced skew-partition. To be able to do induction, we must first adapt the Chudnovsky et al's theorem of structure to our class. We prove a stronger result: Berge tame graphs are basic or have a decomposition such that one side is always basic. We also have an algorithm to compute this decomposition. We then use our theorem to prouve that Berge tame graphs have the big-bipartite property, the clique-stable set separation property and there exists a polytime algorithm to compute the maximum stable set

APA, Harvard, Vancouver, ISO, and other styles

3

Pereira, Luiz Fernando de Faria 1986. "Partições de digrafos em caminhos." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275634.

Full text

Abstract:

Orientador: Orlando Lee
Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-23T03:38:43Z (GMT). No. of bitstreams: 1 Pereira_LuizFernandodeFaria_M.pdf: 862122 bytes, checksum: 06f038348723d2201293366e75808ffd (MD5) Previous issue date: 2013
Resumo: Uma partição em caminhos de um grafo dirigido é uma partição do conjunto de vértices deste grafo em caminhos dirigidos. Dada uma métrica sobre partições em caminhos chamada k-norma, o problema de interesse é estabelecer para um dado grafo quais das suas partições em caminhos tem a menor k-norma dentre todas as suas possíveis partições em caminhos. Chamamos estas partições de k-ótimas. Na década de 1980, Claude Berge conjecturou que para toda partição k-ótima, existe um conjunto de k conjuntos independentes disjuntos que, em certo sentido, interceptam o maior número possível de caminhos desta partição. A validade ou a falsidade desta proposição ainda não foi demonstrada, e ela é conhecida como a conjectura de Berge sobre partições em caminhos. Nesta dissertação, fizemos um estudo geral sobre a conjectura de Berge, sua história recente, e o trabalho matemático que foi desenvolvido sobre ela. Exibimos demonstrações para diversos casos particulares da conjectura que já foram resolvidos, como para grafos bipartidos, hamiltonianos, acíclicos, partições compostas somente de caminhos curtos, partições compostas somente de caminhos longos, e para valores fixos de k. Uma parte significativa do trabalho foi dedicada à reescrita da demonstração recente do caso particular onde k = 2, feita por Eli Berger e Irith Hartman, e uma análise do método usado
Abstract: A path partition of a directed graph is a partition of its vertex set into directed paths. Given a metric over path partitions called the k-norm, the problem we are interested in is to determine for a given graph which of its path partitions have the smallest k-norm among all possible path partitions. These partitions are called k-optimal. In the 1980's, Claude Berge conjectured that for every k-optimal path partition, there exists a set of k disjoint independent sets which intercepts the maximum number of paths in this partition. The validity of this proposition has not yet been demonstrated, and it is known as Berge's conjecture on path partitions. In this work, we consider Berge's conjecture, its recent history, and the related mathematical work that has been accomplished. We show proofs for many particular cases of the conjecture, including for acyclic graphs, bipartite graphs, hamiltonian graphs, partitions which include only short paths, partitions which include only long paths, and for fixed values of k. A significant part of this work was dedicated to the rewriting of a recent proof for the particular case where k = 2 by Eli Berger and Irith Hartman, and an analysis of their method
Mestrado
Ciência da Computação
Mestre em Ciência da Computação

APA, Harvard, Vancouver, ISO, and other styles

4

Hoenig, Bianca [Verfasser], Christof U. [Herausgeber] Mauch, and Helmuth [Herausgeber] Trischler. "Geteilte Berge : Eine Konfliktgeschichte der Naturnutzung in der Tatra / Bianca Hoenig." Göttingen : Vandenhoeck & Ruprecht, 2018. http://www.v-r.de/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hoenig, Bianca, Christof U. Mauch, and Helmuth Trischler. "Geteilte Berge : Eine Konfliktgeschichte der Naturnutzung in der Tatra / Bianca Hoenig." Göttingen : Vandenhoeck & Ruprecht, 2018.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hoenig, Bianca [Verfasser], Christof U. Herausgeber] Mauch, and Helmuth [Herausgeber] [Trischler. "Geteilte Berge : Eine Konfliktgeschichte der Naturnutzung in der Tatra / Bianca Hoenig." Göttingen : Vandenhoeck & Ruprecht, 2018. http://nbn-resolving.de/urn:nbn:de:101:1-2019070800091531733278.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Eide, Marius Berge [Verfasser], and Simon D. M. [Akademischer Betreuer] White. "The Epoch of Reionization / Marius Berge Eide ; Betreuer: Simon D. M. White." München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2020. http://d-nb.info/1225683041/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Berge, Christopher [Verfasser]. "Separation Layers from Sintering of Porous Silicon : Layer Formation and Applications / Christopher Berge." Aachen : Shaker, 2005. http://d-nb.info/1181616220/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Biermann, Kurt-R., and Ingo Schwarz. "Warum bezeichnete sich Alexander von Humboldt als DER ALTE VOM BERGE (Vecchio della Montagna)?" Universität Potsdam, 2008. http://opus.kobv.de/ubp/volltexte/2010/4248/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Van, Berge Peter Jacobus. "Fischer-Tropsch studies in the slurry phase favouring wax production / Peter Jacobus van Berge." Thesis, North-West University, 1994. http://hdl.handle.net/10394/1597.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Berge"

1

Egli, Werner M., and Ingrid Tomkowiak. Berge. Zürich: Chronos, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Friedhuber, Sepp. Berge Afrikas. Steinfurt: Teklenborg, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Friedhuber, Sepp. Berge Afrikas. Steinfurt: Teklenborg, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Schnabel, Michael. Stille Berge. Heidelberg: Edition Braus, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Friedhuber, Sepp. Berge Afrikas. Steinfurt: Teklenborg, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

1929-, Feige Wolfgang, and Westfälischer Heimatbund. Fachstelle Geographische Landeskunde., eds. Die Beckumer Berge. Münster, Westf: Aschendorff, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zehbe, Klaus-Christian. Pfade und Berge. Berlin, Heidelberg: Springer Berlin Heidelberg, 2021. http://dx.doi.org/10.1007/978-3-662-63861-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zambon, Catherine. La Berge haute. Paris: L"ecole des loisirs, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

1927-, Müller Paul Emanuel, ed. Tierwelt der Berge. [S.l.]: Terra Grischuna, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Botschaft der Berge. Innsbruck: Tyrolia, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Berge"

1

Dorn, Bernhard. "Berge versetzen." In Computerbeben, 83–114. Wiesbaden: Gabler Verlag, 1996. http://dx.doi.org/10.1007/978-3-322-84712-6_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bense, Max. "Tallose berge." In Ausgewählte Schriften, 213–15. Stuttgart: J.B. Metzler, 1998. http://dx.doi.org/10.1007/978-3-476-03717-6_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hirt, Alfred M. "Erschöpfte Berge?" In Wirtschaften in den Bergen, 71–96. Wien: Böhlau Verlag, 2020. http://dx.doi.org/10.7767/9783205211365.71.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kleidt, Stephanie. "Berge sammeln." In Berg heil!, 497–506. Köln: Böhlau Verlag, 2011. http://dx.doi.org/10.7788/boehlau.9783412214449.497.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kudryavtsev, Konstantin, Ustav Malkov, and Vladislav Zhukovskiy. "Weak Berge Equilibrium." In Mathematical Optimization Theory and Operations Research, 231–43. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58657-7_20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bumbacher, Stephan Peter. "Berge (fünf heilige)." In Metzler Lexikon Religion, 138–42. Stuttgart: J.B. Metzler, 2005. http://dx.doi.org/10.1007/978-3-476-00091-0_54.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zehbe, Klaus-Christian. "Q-methodologisches Verfahren." In Pfade und Berge, 161–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2021. http://dx.doi.org/10.1007/978-3-662-63861-3_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zehbe, Klaus-Christian. "Zwischenergebnisse für die Konstruktion einer Bildungstheorie." In Pfade und Berge, 189–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2021. http://dx.doi.org/10.1007/978-3-662-63861-3_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zehbe, Klaus-Christian. "Einführung in die Welt des Nō-Kyōgen." In Pfade und Berge, 29–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2021. http://dx.doi.org/10.1007/978-3-662-63861-3_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zehbe, Klaus-Christian. "Operationalisierung von Ordnungsgestalten." In Pfade und Berge, 143–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2021. http://dx.doi.org/10.1007/978-3-662-63861-3_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Berge"

1

Polyakov, V. S., and S. V. Polyakov. "The Definition of Berge Graph by Incidentor Matrix." In 2019 International Multi-Conference on Industrial Engineering and Modern Technologies (FarEastCon). IEEE, 2019. http://dx.doi.org/10.1109/fareastcon.2019.8933846.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kudryavtsev, Konstantin, and Ustav Malkov. "Computation the Weak Berge Equilibrium in Finite 3-Person Games." In 2020 Ural Symposium on Biomedical Engineering, Radioelectronics and Information Technology (USBEREIT). IEEE, 2020. http://dx.doi.org/10.1109/usbereit48449.2020.9117629.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gao, Jian, and Hamidou Tembine. "Empathy and berge equilibria in the forwarding dilemma in relay-enabled networks." In 2017 International Conference on Wireless Networks and Mobile Communications (WINCOM). IEEE, 2017. http://dx.doi.org/10.1109/wincom.2017.8238199.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Dumitrescu, D., Rodica Ioana Lung, and Noemi Gasko. "Detecting Strong Berge Pareto equilibrium in a non-cooperative game using an evolutionary approach." In 2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI). IEEE, 2011. http://dx.doi.org/10.1109/saci.2011.5872980.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Horn, Agnes Marie, and Kenneth A. Macdonald. "A Tribute to the Extraordinary Research Work Within the Domain of Fatigue and Fracture of Offshore and Ship Structures Carried Out by Prof. Stig Berge and Per Jahn Haagensen at the Norwegian University of Science and Technology." In ASME 2017 36th International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/omae2017-62189.

Full text

Abstract:

The motivation of this paper is to highlight the importance of the work carried out during the last decade by Prof. Haagensen and Prof. Berge at the Norwegian University of Science and Technology NTNU, with the aim to inspire and motivate young engineers to continue their important and valuable research within fatigue and fracture. This paper will focus on their historical contribution to the research within fatigue and fracture of offshore and ship structures. Stig Berge is a professor of Marine Technology at the Norwegian University of Science and Technology NTNU. He has spent his academic carrier focusing on fatigue of offshore and ship structures; he has published more than 70 papers and articles in well-known journals and conferences since 80’s. Per Jahn Haagensen is currently an Emeritus professor at Department of Mechanical Engineering and Logistic Faculty of Technology. He has spent his whole research carrier within fatigue and fracture related topics mainly for the offshore industry. He is especially known for the different fatigue improvement methods which have been developed since the 90’s. He has until recently been an active member of the International Institute of Welding (IIW). This article aims to present their main findings and conclusions from their long academic carrier. While the authors have strived to convey in a single paper an overview of the careers and important contributions, the Professors themselves may well have chosen to place a different emphasis on their work.

APA, Harvard, Vancouver, ISO, and other styles

6

Sambinelli, M., C. N. Lintzmayer, C. N. Da Silva, and O. Lee. "Vertex partition problems in digraphs ⇤." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3174.

Full text

Abstract:

Let D be a digraph and k be a positive integer. Linial (1981) conjectured that the k-norm of a k-minimum path partition of a digraph D is at most max{PC2 C |C| : C is a partial k-coloring of D}. Berge (1982) conjectured that every k-minimum path partition contains a partial k-coloring orthogonal to it. It is well known that Berge's Conjecture implies Linial's Conjecture. In this work, we verify Berge's Conjecture, and consequently Linial's Conjecture, for locally in-semicomplete digraphs and k-minimum path partitions containing only two paths. Moreover, we verify a conjecture related to Berge's and Linial's Conjectures for locally in-semicomplete digraphs.

APA, Harvard, Vancouver, ISO, and other styles

7

Silva, Caroline, Cândida Silva, and Orlando Lee. "A proof for Berges Dual Conjecture for Bipartite Digraphs." In IV Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/etc.2019.6398.

Full text

Abstract:

Given a (vertex)-coloring C = C 1 , C 2 , ...C m of P a digraph D and a positive integer k, the k-norm of C is defined as C k = m i=1 min C i, k. A coloring C is k-optimal if its k-norm C k is minimum over all colorings. A (path) k-pack P k is a collection of at most k vertex-disjoint paths. A coloring C and a k-pack P k are orthogonal if each color class intersects as many paths as possible in P k , that is, if C i k, C i P j = 1 for every path P j P k , otherwise each vertex of C i lies in a different path of P k . In 1982, Berge conjectured that for every k-optimal coloring C there is a k-pack P k orthogonal to C. This conjecture is false for arbitrary digraphs, having a counterexample with odd cycle. In this paper we prove this conjecture for bipartite digraphs.

APA, Harvard, Vancouver, ISO, and other styles

8

Sambinelli, M., C. N. Da Silva, and O. Lee. "Diperfect Digraphs." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3173.

Full text

Abstract:

Let D be a digraph. A path partition P of D is a collection of paths such that {V (P ) : P 2 P } is a partition of V (D). We say D is ↵ -diperfect if for every maximum stable set S of D there exists a path partition P of D such that |S \ V (P )| = 1 for all P 2 P and this property holds for every induced subdigraph of D. A digraph C is an anti-directed odd cycle if (i) the underlying graph of C is a cycle x1x2 · · · x2k+1x1, where k 2, (ii) the longest path in C has length 2, and (iii) each of the vertices x1, x2, x3, x4, x6, x8, . . . , x2k is either a source or a sink. Berge (1982) conjectured that a digraph D is ↵ -diperfect if, and only if, D contains no induced anti-directed odd cycle. In this work, we verify this conjecture for digraphs whose underlying graph is series-parallel and for in-semicomplete digraphs.

APA, Harvard, Vancouver, ISO, and other styles

9

Wagner, H., F. Peñaherrera, S. Fayed, O. Werth, S. Eckhoff, B. Engel, M. H. Breitner, S. Lehnhoff, and J. Rolink. "Co-simulation-based analysis of the grid capacity for electric vehicles in districts: the case of “Am Ölper Berge” in Lower Saxony." In 6th E-Mobility Power System Integration Symposium (EMOB 2022). Institution of Engineering and Technology, 2022. http://dx.doi.org/10.1049/icp.2022.2713.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Gosweiller, Christoph, Bryan Willson, and Thomas Walter. "Application of an Improved Model for the Determination of Acoustic Resonances in Indicator Passages for Combustion Pressure Measurements." In ASME 2006 Internal Combustion Engine Division Spring Technical Conference. ASMEDC, 2006. http://dx.doi.org/10.1115/ices2006-1373.

Full text

Abstract:

The acoustic resonances in indicator passages are often modeled using either a Helmholtz or a so called organ pipe acoustical model. However, in practice these models often indicate natural frequencies which are too high. This paper proposes the Bergh and Tijdeman model [1] which is more accurate and which was originally developed for pressure measurements in turbomachinery. This paper presents the theoretical basis for the Berg / Tijdeman model and then uses it to explore signal distortion from a variety of indicator passage geometries. In order to validate the approach, a flush-mounted water-cooled Kistler reference transducer was used to measure accurate in-cylinder combustion data in an automotive Diesel engine. An additional sensor was recess mounted with passages of different geometries. The Bergh Tijdeman model was then applied to investigate the acoustic distortion of the indicator passages. The results show excellent agreement with the experimental data, which are much closer than using the Helmholtz or the organ pipe model. Further the Bergh and Tijdeman model is applied to complex indicator passage geometries with multiple cavities. Again, for comparison, a flush-mounted Kistler reference transducer was used to measure accurate in-cylinder combustion data in a large-bore natural gas engine. Three additional sensors were mounted using different indicator passage geometries. The engine was operated under base line and knocking combustion conditions. The Bergh Tijdeman model was then applied to model the acoustic distortion of the three indicator passages and again showed good agreement with the experimental data. Finally, the paper proposes simple rules for implementing indicator passages in large gas engines.

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Berge"

1

Rysjedal, Fredrik. Frozen Moments in Motion. Universitetet i Bergen KMD, January 2019. http://dx.doi.org/10.22501/kmd-ar.31524.

Full text

Abstract:

What are the concepts of motion in digital comics? What types of motion can be used in comics and how does motion affect the presentation, the story and even the reader/viewer? This project is a part of the Norwegian Programme for Artistic Research, and it's executed at the Bergen Academy of Art and Design, today called Faculty of Fine Art, Music and Design at the University of Bergen.

APA, Harvard, Vancouver, ISO, and other styles

2

Irminger, Bente. Økt interesse for kreativitet åpner for nye designerroller- men skaper også behov for rolleavklaringer. Universitetet i Bergen KMD, January 2018. http://dx.doi.org/10.22501/kmd-ar.1090265.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Irminger, Bente. A growing interest in creativity is opening up new roles for the designer- but also creating a need for clarification of these roles. Universitetet i Bergen KMD, January 2018. http://dx.doi.org/10.22501/kmd-ar.1090256.

Full text

Abstract:

Bente Irminger, ‘A growing interest in creativity is opening up new roles for the designer- but also creating a need for clarification of these roles‘, Faculty of Fine Art, Music and Design, University of Bergen

APA, Harvard, Vancouver, ISO, and other styles

4

Lala, P. K., and A. Walker. Modular Implementation of Efficient Self-Checking Checkers for the Berger Code. Fort Belvoir, VA: Defense Technical Information Center, March 1996. http://dx.doi.org/10.21236/ada310441.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bakker, Annalieke, Gea van der Lee, Ralf Verdonschot, and Piet Verdonschot. Notitie KIWK : maatregeleffectiviteit plasherstel : algenrespons op nutriëntenreductie in de Bergse Plassen. Wageningen: Zoetwaterecosystemen, Wageningen Environmental Research, Wageningen UR, 2021. http://dx.doi.org/10.18174/556872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lezaun, Javier, Sara Nawaz, and Jose M. Valenzuela. Summary report on deliberative workshop with stakeholders on mesocosm research in Bergen, Norway. OceanNets, 2022. http://dx.doi.org/10.3289/oceannets_d7.2.

Full text

Abstract:

This report summarises the stakeholder engagement work conducted with actors in the Bergen region during OceanNETs research activities on ocean alkalinity enhancement. We describe our approach to stakeholder engagement and summarize some key insights derived from this process.

APA, Harvard, Vancouver, ISO, and other styles

7

Armesto, Michelle T., Rubén Hernández-Murillo, Michael T. Owyang, and Jeremy M. Piger. “Measuring the Information Content of the Beige Book: A Mixed Data Sampling. Federal Reserve Bank of St. Louis, 2007. http://dx.doi.org/10.20955/wp.2007.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Grodowitz, Michael, Nathan Harms, and Jan Freedman. The influence of fluctuating temperature on Megamelus scutellaris Berg (Hemiptera: Delphacidae). Environmental Laboratory (U.S.), July 2017. http://dx.doi.org/10.21079/11681/22743.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

zheng, ying, and yun xiang. Rehabilitation effect of lower-limb motor function in stroke patients with Chinese traditional exercises : A systematic review and Meta-analysis. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, February 2022. http://dx.doi.org/10.37766/inplasy2022.2.0039.

Full text

Abstract:

Review question / Objective: To systematically evaluate the effectiveness of Chinese traditional exercises（CTE）in the rehabilitation of lower-limb motor function in stroke patients by Meta analysis statistical method. Condition being studied: Stroke and motor dysfunction. Main outcome(s): Fugl-Meyer Motor Scale (FMA) and Berg Balance Scale (BBS), the higher the score, the lower the degree of Motor dysfunction; The timed "Up & Go" test shows that the shorter the test time is, the lower the degree of motor dysfunction.

APA, Harvard, Vancouver, ISO, and other styles

10

Freedman, Jan, and Nathan Harms. Rearing and release of Megamelus scutellaris Berg (Hemiptera: Delphacidae) for biological control of waterhyacinth in 2015. Environmental Laboratory (U.S.), July 2017. http://dx.doi.org/10.21079/11681/22762.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!