Relevant bibliographies by topics / Branching

Academic literature on the topic 'Branching'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 June 2024

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

Select a source type:

Contents

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

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 "Branching"

1

Boy, Insan, Gerhard Cordier, and Rüdiger Kniep. "Oligomere Tetraeder-Anionen in Borophosphaten: Sechserringe mit offenen und cyclischen Phosphat-Verzweigungen in der Kristallstruktur von K6Cu2[B4P8O28(OH)6] / Oligomeric Tetrahedral Anions in Borophosphates: Six-Membered Rings with Open and Cyclic Phosphate Branchings in the Crystal Structure of K6Cu2[B4P8O28(OH)6]." Zeitschrift für Naturforschung B 53, no. 12 (December 1, 1998): 1440–44. http://dx.doi.org/10.1515/znb-1998-1205.

Full text
Abstract:
Abstract Crystals of K6Cu2[B4PhO28(OH)6] were grown under hydrothermal conditions at 160 °C. The crystal structure (monochnic, P21/c (Nr. 14), a = 961.8(1), b = 1755.0(1), c = 942.0(1) pm, β = 112.29(1)°, Z = 2) contains oligomeric tetrahedral anions based on six-membered rings {B4P2O10O8/2} with additional branchings by hydrogenphosphate-groups (open branching: 4 x HPO3O1/2; cyclic branching: 2 x HPO2O2/2). The complex borophosphate anion is represented by the formula [B4P8O28(OH)6]10-. Cu2+ is in a tetragonal pyramidal and K+ in an irregular coordination by eight and nine oxygen ligands, respectively.
APA, Harvard, Vancouver, ISO, and other styles
2

Ueno, Yoshiaki. "Branching flags, branching nets, and reverse matchings." Journal of Combinatorial Theory, Series A 53, no. 1 (January 1990): 117–27. http://dx.doi.org/10.1016/0097-3165(90)90023-p.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Patel, Jitendra P., Naimish R. Bhojak, and Jalpa N. Desai. "Variations in branching pattern of arch of aorta in Gujarat region." National Journal of Clinical Anatomy 05, no. 04 (October 2016): 185–90. http://dx.doi.org/10.1055/s-0039-3401612.

Full text
Abstract:
Abstract Background and aim: Study of variation in branching pattern of arch of aorta is important for cardio­ vascular surgeons to avoid injury during procedures like angiography and stenting of aorta. These variations are frequently encountered during surgical procedures, as a developmental alteration in branchial arch during embryonic period. The aim of present study is to describe variation in branching pattern of arch of aorta belonging to Gujarati population and these results will be of significance for anatomists for relating it with embryological basis, cardiovascular surgeons and radiologists. Materials and metbods: Forty embalmed cadavers were observed for study of branching pattern of arch of aorta during period of four year in Department of Anatomy in Smt N.H.L.Municipal Medical College, Ahmedabad. Results: In the present study, normal branching pattern of the arch of aorta was found in 92.5% cases. In 2.5% cases only two vessels originated from the arch of aorta, one of them was common trunk for brachiocephalic trunk and left common carotid artery and the second trunk was left subclavian artery. In 5% of cases four vessels arose from arch of aorta, the left vertebral artery arose directly from aorta with normal branching pattern. Conclusion: Vascular invasive procedures are increasing since last decade. So knowledge of variation in branches of arch of aorta is essential for cardiologist, cardiovascnlar surgeon as well as for radiologist.
APA, Harvard, Vancouver, ISO, and other styles
4

Flannery, Maura C. "Branching Out." American Biology Teacher 47, no. 4 (April 1, 1985): 246–48. http://dx.doi.org/10.2307/4448034.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Surridge, Chris. "Branching roots." Nature Plants 7, no. 12 (December 2021): 1520. http://dx.doi.org/10.1038/s41477-021-01064-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Inês. "Branching regulation." Nature Structural & Molecular Biology 19, no. 10 (October 2012): 982. http://dx.doi.org/10.1038/nsmb.2406.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

List, Carla. "Branching Out:." Reference Librarian 24, no. 51-52 (July 20, 1995): 385–98. http://dx.doi.org/10.1300/j120v24n51_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Goodwin, Katharine, and Celeste M. Nelson. "Branching morphogenesis." Development 147, no. 10 (May 15, 2020): dev184499. http://dx.doi.org/10.1242/dev.184499.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lipschutz, Joshua H. "Branching out." American Journal of Physiology-Renal Physiology 293, no. 4 (October 2007): F985—F986. http://dx.doi.org/10.1152/ajprenal.00292.2007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kritikou, Ekat. "Branching out." Nature Reviews Molecular Cell Biology 9, S1 (December 1, 2008): s20—s21. http://dx.doi.org/10.1038/nrm2565.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Branching"

1

Zhu, Qingsan. "Critical branching random walks, branching capacity and branching interlacements." Thesis, University of British Columbia, 2017. http://hdl.handle.net/2429/62928.

Full text
Abstract:
This thesis concerns critical branching random walks. We focus on supercritical (d ≥ 5 or higher) and critical (d=4) dimensions. In this thesis, we extend the potential theory for random walk to critical branching random walk. In supercritical dimensions, we introduce branching capacity for every finite subset of ℤ^d and construct its connections with critical branching random walk through the following three perspectives. 1. The visiting probability of a finite set by a critical branching random walk starting far away; 2. Branching recurrence and branching transience; 3. Local limit of branching random walk in torus conditioned on the total size. Moreover, we establish the model which we call 'branching interlacements' as the local limit of branching random walk in torus conditioned on the total size. In the critical dimension, we also construct some parallel results. On the one hand, we give the asymptotics of visiting a finite set and the convergence of the conditional hitting point. On the other hand, we establish the asymptotics of the range of a branching random walk conditioned on the total size. Also in this thesis, we analyze a small game which we call the Majority-Markov game and give an optimal strategy.
Science, Faculty of
Mathematics, Department of
Graduate
APA, Harvard, Vancouver, ISO, and other styles
2

Komen, Erwin R. "Branching constraints." Universität Potsdam, 2009. http://opus.kobv.de/ubp/volltexte/2009/3227/.

Full text
Abstract:
Rejecting approaches with a directionality parameter, mainstream minimalism has adopted the notion of strict (or unidirectional) branching. Within optimality theory however, constraints have recently been proposed that presuppose that the branching direction scheme is language specific. I show that a syntactic analysis of Chechen word order and relative clauses using strict branching and movement triggered by feature checking seems very unlikely, whereas a directionality approach works well. I argue in favor of a mixed directionality approach for Chechen, where the branching direction scheme depends on the phrase type. This observation leads to the introduction of context variants of existing markedness constraints, in order to describe the branching processes in terms of optimality theory. The paper discusses how and where the optimality theory selection of the branching directions can be implemented within a minimalist derivation.
APA, Harvard, Vancouver, ISO, and other styles
3

Harris, Simon Colin. "Branching diffusions." Thesis, University of Cambridge, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387607.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hardy, Robert. "Branching diffusions." Thesis, University of Bath, 2003. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.410689.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Meinecke, Ingmar. "Weighted Branching Automata." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2005. http://nbn-resolving.de/urn:nbn:de:swb:14-1133443150529-27676.

Full text
Abstract:
Eine der stärksten Erweiterungen der klassischen Theorie formaler Sprachen und Automaten ist die Einbeziehung von Gewichten oder Vielfachheiten aus einem Halbring. Diese Dissertation untersucht gewichtete Automaten über Strukturen mit Nebenläufigkeit. Wir erweitern die Arbeit von Lodaya und Weil und erhalten so ein Modell gewichteter verzweigender Automaten, in dem die Berechnung des Gewichts einer parallelen Komposition anders als die einer sequentiellen Komposition gehandhabt wird. Die von Lodaya und Weil eingeführten Automaten modellieren Nebenläufigkeit durch Verzweigen. Ein verzweigender Automat ist ein endlicher Automat mit drei verschiedenen Typen von Transitionen. Sequentielle Transitionen überführen durch Ausführen eines Ereignisses einen Zustand in einen anderen. Dagegen sind Gabel- und Binde-Transitionen für das Verzweigen verantwortlich. Läufe dieser Automaten werden beschrieben durch sequentiell-parallele posets, kurz sp-posets. Alle Transitionen des Automaten werden in unserem Modell mit Gewichten versehen. Neben dem Nichtdeterminismus und der sequentiellen Komposition wollen wir nun auch die parallele Komposition quantitativ behandeln. Dafür benötigen wir eine Gewichtsstruktur mit einer Addition, einer sequentiellen und einer parallelen Multiplikation. Solch eine Struktur, genannt Bihalbring, besteht damit de facto aus zwei Halbringen mit derselben additiven Struktur. Weiterhin muss die parallele Multiplikation kommutativ sein. Das Verhalten eines gewichteten verzweigenden Automaten ist dann eine Funktion, die jeder sp-poset ein Element eines Bihalbrings zuordnet. Das Hauptresultat charakterisiert das Verhalten dieser Automaten im Sinne von Kleenes und Schützenbergers Sätzen über das Zusammenfallen der Klassen der erkennbaren und der rationalen Sprachen bzw. formalen Potenzreihen. Darüber hinaus untersuchen wir den Abschluss dieser Verhalten unter allen rationalen Operationen und unter dem Hadamard-Produkt. Letztlich diskutieren wir Zusammenhänge zwischen Reihen und Sprachen im Rahmen verzweigender Automaten
One of the most powerful extensions of classical formal language and automata theory is the consideration of weights or multiplicities from a semiring. This thesis investigates weighted automata over structures incorporating concurrency. Extending work by Lodaya and Weil, we propose a model of weighted branching automata in which the calculation of the weight of a parallel composition is handled differently from the calculation of the weight of a sequential composition. The automata as proposed by Lodaya and Weil model concurrency by branching. A branching automaton is a finite-state device with three different types of transitions. Sequential transitions transform a state into another one by executing an action. In contrast, fork and join transitions are responsible for branching. Executions of such systems can be described by sequential-parallel posets, or sp-posets for short. In the model considered here all kinds of transitions are equipped with weights. Beside non-determinism and sequential composition we would like to deal with the parallel composition in a quantitative way. Therefore, we are in need of a weight structure equipped with addition, a sequential, and, moreover, a parallel multiplication. Such a structure, called a bisemiring, is actually composed of two semirings with the same additive structure. Moreover, the parallel multiplication has to be commutative. Now, the behavior of a weighted branching automaton is a function that associates with every sp-poset an element from the bisemiring. The main result characterizes the behavior of these automata in the spirit of Kleene's and Schützenberger's theorems about the coincidence of recognizable and rational languages, and formal power series, respectively. Moreover, we investigate the closure of behaviors under all rational operations and under Hadamard-product. Finally, we discuss connections between series and languages within our setting
APA, Harvard, Vancouver, ISO, and other styles
6

Bailey, James Patrick. "Octanary branching algorithm." Thesis, Kansas State University, 2012. http://hdl.handle.net/2097/13801.

Full text
Abstract:
Master of Science
Department of Industrial and Manufacturing Systems Engineering
Todd Easton
Integer Programs (IP) are a class of discrete optimization that have been used commercially to improve various systems. IPs are often used to reach an optimal financial objective with constraints based upon resources, operations and other restrictions. While incredibly beneficial, IPs have been shown to be NP-complete with many IPs remaining unsolvable. Traditionally, Branch and Bound (BB) has been used to solve IPs. BB is an iterative algorithm that enumerates all potential integer solutions for a given IP. BB can guarantee an optimal solution, if it exists, in finite time. However, BB can require an exponential number of nodes to be evaluated before terminating. As a result, the memory of a computer using BB can be exceeded or it can take an excessively long time to find the solution. This thesis introduces a modified BB scheme called the Octanary Branching Algorithm (OBA). OBA introduces eight children in each iteration to more effectively partition the feasible region of the linear relaxation of the IP. OBA also introduces equality constraints in four of the children in order to reduce the dimension of the remaining nodes. OBA can guarantee an optimal solution, if it exists, in finite time. In addition, OBA has been shown to have some theoretical improvements over traditional BB. During computational tests, OBA was able to find the first, second and third integer solution with 64.8%, 27.9% and 29.3% fewer nodes evaluated, respectively, than CPLEX. These integers were 44.9%, 54.7% and 58.2% closer to the optimal solution, respectively, when compared to CPLEX. It is recommended that commercial solvers incorporate OBA in the initialization and random diving phases of BB.
APA, Harvard, Vancouver, ISO, and other styles
7

Harris, John William. "Branching diffusion processes." Thesis, University of Bath, 2006. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.428379.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Fittipaldi, María Clara. "Representation results for continuos-state branching processes and logistic branching processes." Tesis, Universidad de Chile, 2014. http://www.repositorio.uchile.cl/handle/2250/116458.

Full text
Abstract:
Doctora en Ciencias de la Ingeniería, Mención Modelación Matemática
El objetivo de este trabajo es explorar el comportamiento de los procesos de rami ficación evolucionando a tiempo y estados continuos, y encontrar representaciones para su trayectoria y su genealogía. En el primer capítulo se muestra que un proceso de ramifi cación condicionado a no extinguirse es la única solución fuerte de una ecuación diferencial estocástica conducida por un movimiento Browniano y una medida puntual de Poisson, más un subordinador que representa la inmigración, dónde estos procesos son mutuamente independientes. Para esto se usa el hecho de que es posible obtener la ley del proceso condicionado a partir del proceso original, a través de su h-transformada, y se da una manera trayectorial de construir la inmigración a partir de los saltos del proceso. En el segundo capítulo se encuentra una representación para los procesos de rami ficación con crecimiento logístico, usando ecuaciones estocásticas. En particular, usando la de finición general dada por A. Lambert, se prueba que un proceso logístico es la única solución fuerte de una ecuación estocástica conducida por un movimiento Browniano y una medida puntual de Poisson, pero con un drift negativo fruto de la competencia entre individuos. En este capítulo se encuentra además una ecuación diferencial estocástica asociada con un proceso logístico condicionado a no extinguirse, suponiendo que éste existe y que puede ser de finido a través de una h-transformada. Esta representación muestra que nuevamente el condicionamiento da origen a un término correspondiente a la inmigración, pero en este caso dependiente de la población. Por último, en el tercer capítulo se obtiene una representación de tipo Ray-Knight para los procesos de ramifi cación logísticos, lo que da una descripción de su genealogía continua. Para esto, se utiliza la construcción de árboles aleatorios continuos asociados con procesos de Lévy generales dada por J.-F. Le Gall e Y. Le Jan, y una generalización del procedimiento de poda desarrollado por R. Abraham, J.-F. Delmas. Este resultado extiende la representación de Ray-Knight para procesos de difusión logísticos dada por V. Le, E. Pardoux y A. Wakolbinger.
APA, Harvard, Vancouver, ISO, and other styles
9

Eick, Ernst Christopher [Verfasser], and Gerold [Akademischer Betreuer] Alsmeyer. "Branching within branching in random environment / Ernst Christopher Eick ; Betreuer: Gerold Alsmeyer." Münster : Universitäts- und Landesbibliothek Münster, 2020. http://d-nb.info/1215183356/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bannister, Iveta. "Branching copolymerisations by ATRP." Thesis, University of Sussex, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.499571.

Full text
Abstract:
Sherrington and co-workers have shown that branched vinyl polymers can be synthesized by the addition of a chain transfer agent to a conventional free radical statistical copolymerisation of a vinyl and a divinyl monomer. In the presence of the chain transfer agent, the molecular weight of the primary chains is reduced, gelation can be suppressed and soluble, branched polymers are obtained as the sole product. Living polymerisation techniques offer a way to control the primary chain length without the need for a transfer agent simply by adjusting the monomer/initiator molar ratio. It is suggested that a significant degree of intramolecular cyclisation is the most likely explanation for the remarkable delay in the onset of gelation.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Branching"

1

Davies, Jamie A. Branching Morphogenesis. Boston, MA: Springer US, 2006. http://dx.doi.org/10.1007/0-387-30873-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Heyde, C. C., ed. Branching Processes. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-2558-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Branching out. Oxford: ISIS, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nakamura, Leonard I. Bank branching. Philadelphia: Federal Reserve Bank of Philadelphia, EconomicResearch Division, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Igbinosum, Lilian. Evolving branching structures. London: University of East London, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fleury, Vincent, Jean-François Gouyet, and Marc Léonetti, eds. Branching in Nature. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-06162-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

González Velasco, Miguel, Inés M. del Puerto García, and George P. Yanev. Controlled Branching Processes. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2018. http://dx.doi.org/10.1002/9781119452973.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shi, Zhan. Branching Random Walks. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25372-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Svigals, Jerome. Bank branching 2000. Dublin: Lafferty Publications, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

M, Ahsanullah, and Yanev George P, eds. Records and branching processes. Hauppauge, N.Y: Nova Science Publishers, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Branching"

1

van Dongen, M. R. C. "Branching." In X.media.publishing, 209–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23816-1_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gooch, Jan W. "Branching." In Encyclopedic Dictionary of Polymers, 92. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-6247-8_1552.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Weik, Martin H. "branching." In Computer Science and Communications Dictionary, 143. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1820.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fomin, Fedor V., and Dieter Kratsch. "Branching." In Exact Exponential Algorithms, 13–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16533-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Davies, Jamie A. "Why a Book on Branching, and Why Now?" In Branching Morphogenesis, 1–7. Boston, MA: Springer US, 2005. http://dx.doi.org/10.1007/0-387-30873-3_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yadav, Sumit Kumar. "Branching Processes." In Advances in Analytics and Applications, 31–41. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1208-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Privault, Nicolas. "Branching Processes." In Springer Undergraduate Mathematics Series, 189–209. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-0659-4_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rozanov, Yuriĭ A. "Branching Processes." In Introduction to Random Processes, 25–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-642-72717-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Pardoux, Étienne. "Branching Processes." In Probabilistic Models of Population Evolution, 5–11. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30328-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Berthold, Timo, and Ambros M. Gleixner. "Undercover Branching." In Experimental Algorithms, 212–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38527-8_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Branching"

1

Oka, Takuya, and Haruo Honjo. "Branching structure of dense-branching morphology." In The 8th tohwa university international symposium on slow dynamics in complex systems. AIP, 1999. http://dx.doi.org/10.1063/1.58462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sabin, Jenny E., and Peter Lloyd Jones. "Branching morphogenesis." In ACM SIGGRAPH 2008 art gallery. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1400385.1400391.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Peschlow, Patrick, Peter Martini, and Jason Liu. "Interval Branching." In 2008 ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation ( PADS). IEEE, 2008. http://dx.doi.org/10.1109/pads.2008.8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Carvalho, Cláudio, Jonas Costa, Raul Lopes, Ana Karolina Maia, Nicolas Nisse, and Cláudia Linhares Sales. "Characterizing Networks Admitting k Arc-disjoint Branching Flows." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11089.

Full text
Abstract:
An s-branching flow f in a network N = (D,c) (where c is the capacity function) is a flow that reaches every vertex in V(D) \ {s} from s while loosing exactly one unit of flow in each vertex other than s. In other words, the difference between the flow entering a vertex v and a flow leaving a vertex v is one whenever v is different from s. It is known that the hardness of the problem of finding k arc-disjoint s-branching flows in network N is linked to the capacity c of the arcs in N: the problem is solvable in polynomial time if every arc has capacity n - l, for fixed l, and NP-complete in most other cases, with very few cases open. We further investigate a conjecture by Costa et al. from 2019 that aims to characterize networks admitting k arc-disjoint s-branching flows, generalizing a classical result by Edmonds that provides such characterization when all arcs have capacity n-1. We show that, in general, the conjecture is false. However, on the positive side, it holds for digraphs formed by out-branchings together with parallel arcs.
APA, Harvard, Vancouver, ISO, and other styles
5

Cooke, W. E., G. T. Xu, and Lei Zhou. "Branching ratio spectroscopy." In The XIth International conference on laser spectroscopy. AIP, 1993. http://dx.doi.org/10.1063/1.45086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Trivedi, Ashutosh, and Dominik Wojtczak. "Timed Branching Processes." In 2010 Seventh International Conference on the Quantitative Evaluation of Systems (QEST). IEEE, 2010. http://dx.doi.org/10.1109/qest.2010.36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Phillips, Shaun, Jonathan Sillito, and Rob Walker. "Branching and merging." In Proceeding of the 4th international workshop. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1984642.1984645.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Fahland, Dirk, David Lo, and Shahar Maoz. "Mining branching-time scenarios." In 2013 IEEE/ACM 28th International Conference on Automated Software Engineering (ASE). IEEE, 2013. http://dx.doi.org/10.1109/ase.2013.6693102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fujii, F., and H. Noguchi. "MULTIPLE HILL-TOP BRANCHING." In Proceedings of the Second International Conference. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812776228_0068.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Brackx, F., H. De Schepper, and R. Lávička. "Branching of monogenic polynomials." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2012: International Conference of Numerical Analysis and Applied Mathematics. AIP, 2012. http://dx.doi.org/10.1063/1.4756123.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Branching"

1

Mytnik, Leonid, and Robert J. Adler. Bisexual Branching Diffusions. Fort Belvoir, VA: Defense Technical Information Center, December 1993. http://dx.doi.org/10.21236/ada274698.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mytnik, Leonid, and Robert J. Adler. Bisexual Branching Diffusions. Fort Belvoir, VA: Defense Technical Information Center, December 1993. http://dx.doi.org/10.21236/ada275123.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Puerto, Inés M. del, George P. Yanev, Manuel Molina, Nikolay M. Yanev, and Miguel González. Continuous-time Controlled Branching Processes. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, March 2021. http://dx.doi.org/10.7546/crabs.2021.03.04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nicol, Neil Allen. Measurement of tau lepton branching fractions. Office of Scientific and Technical Information (OSTI), September 1993. http://dx.doi.org/10.2172/10105803.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hwa, R. C. Geometrical scaling, furry branching and minijets. Office of Scientific and Technical Information (OSTI), January 1988. http://dx.doi.org/10.2172/6039439.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nicol, N. Measurement of Tau Lepton Branching Fractions. Office of Scientific and Technical Information (OSTI), December 2003. http://dx.doi.org/10.2172/826655.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Leandre, Remi. Galton–Watson Tree and Branching Loops. GIQ, 2012. http://dx.doi.org/10.7546/giq-6-2005-276-283.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Durham, Stephen D., and Kai F. Yu. Regenerative Sampling and Monotonic Branching Processes. Fort Belvoir, VA: Defense Technical Information Center, May 1986. http://dx.doi.org/10.21236/ada170145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Guiltinan, Mark J., and Donald Thompson. Molecular Genetic Analysis of Maize Starch Branching Isoforms: Modulation of Starch Branching Enzyme Isoform Activities in Maize to Produce Starch with Novel Branching Architecture and Properties. Office of Scientific and Technical Information (OSTI), July 2009. http://dx.doi.org/10.2172/961611.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Michels, H. H. Kinetic Branching of the N* + O2 Reaction. Fort Belvoir, VA: Defense Technical Information Center, December 1990. http://dx.doi.org/10.21236/ada229999.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Branching' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography