Academic literature on the topic 'Maximum average degree'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Maximum average degree.'
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 "Maximum average degree"
Kopreski, Michael, and Gexin Yu. "Maximum average degree and relaxed coloring." Discrete Mathematics 340, no. 10 (October 2017): 2528–30. http://dx.doi.org/10.1016/j.disc.2017.06.014.
Full textDankelmann, P., and F. J. Osaye. "Average eccentricity, minimum degree and maximum degree in graphs." Journal of Combinatorial Optimization 40, no. 3 (June 26, 2020): 697–712. http://dx.doi.org/10.1007/s10878-020-00616-x.
Full textFiedorowicz, Anna. "Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree." Discussiones Mathematicae Graph Theory 33, no. 1 (2013): 91. http://dx.doi.org/10.7151/dmgt.1665.
Full textBonamy, Marthe, Benjamin Lévêque, and Alexandre Pinlou. "Graphs with maximum degreeΔ≥17and maximum average degree less than3are list2-distance(Δ+2)-colorable." Discrete Mathematics 317 (February 2014): 19–32. http://dx.doi.org/10.1016/j.disc.2013.10.022.
Full textMiao, Lianying, Jibin Qu, and Qingbo Sun. "On the average degree of critical graphs with maximum degree six." Discrete Mathematics 311, no. 21 (November 2011): 2574–76. http://dx.doi.org/10.1016/j.disc.2011.06.029.
Full textHavet, Frédéric, and Jean-Sébastien Sereni. "Improper choosability of graphs and maximum average degree." Journal of Graph Theory 52, no. 3 (2006): 181–99. http://dx.doi.org/10.1002/jgt.20155.
Full textFeghali, Carl. "Reconfiguring colorings of graphs with bounded maximum average degree." Journal of Combinatorial Theory, Series B 147 (March 2021): 133–38. http://dx.doi.org/10.1016/j.jctb.2020.11.001.
Full textBonamy, Marthe, Hervé Hocquard, Samia Kerdjoudj, and André Raspaud. "Incidence coloring of graphs with high maximum average degree." Discrete Applied Mathematics 227 (August 2017): 29–43. http://dx.doi.org/10.1016/j.dam.2017.04.029.
Full textLiang, Yu-Chang, Tsai-Lien Wong, and Xuding Zhu. "Graphs with maximum average degree less than114are(1,3)-choosable." Discrete Mathematics 341, no. 10 (October 2018): 2661–71. http://dx.doi.org/10.1016/j.disc.2018.06.036.
Full textPrzybyło, Jakub, André Raspaud, and Mariusz Woźniak. "On weight choosabilities of graphs with bounded maximum average degree." Discrete Applied Mathematics 217 (January 2017): 663–72. http://dx.doi.org/10.1016/j.dam.2016.09.037.
Full textDissertations / Theses on the topic "Maximum average degree"
Hocquard, Hervé. "Colorations de graphes sous contraintes." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2011. http://tel.archives-ouvertes.fr/tel-00987686.
Full textDross, François. "Vertex partition of sparse graphs." Thesis, Montpellier, 2018. http://www.theses.fr/2018MONTS011/document.
Full textThe study of vertex partitions of planar graphs was initiated by the Four Colour Theorem, which was conjectured in 1852, and proven in 1976. According to that theorem, one can colour the regions of any planar map by using only four colours, in such a way that any two regions sharing a border have distinct colours. In terms of graph theory, it can be reformulated this way: the vertex set of every planar graph, i.e. every graph that can be represented in the plane such that edges do not cross, can be partitioned into four sets such that no edge has its two endpoints in the same set. Such a partition is called a proper colouring of the graph.In this thesis, we look into the structure of sparse graphs, according to several notions of sparsity. On the one hand, we consider planar graphs with no small cycles, and on the other hand, we consider the graphs where every subgraph has bounded average degree.For these classes of graphs, we first look for the smallest number of vertices that can be removed such that the remaining graph is a forest, that is a graph with no cycles. That can be seen as a partition of the vertices of the graph into a set inducing a forest and a set with a bounded fraction of the vertices of the graph. The main motivation for this study is a the Albertson and Berman Conjecture (1976), which states that every planar graph admits an induced forest containing at least one half of its vertices.We also look into vertex partition of sparse graphs into two sets both inducing a subgraph with some specific prescribed properties. Exemples of such properties can be that they have no edges, or no cycles, that they have bounded degree, or that they have bounded components. These vertex partitions generalise the notion of proper colouring. We show, for different classes of sparse graphs, that every graph in those classes have some specific vertex partition. We also look into algorithmic aspects of these partitions
Chen, Min. "Vertex coloring of graphs via the discharging method." Thesis, Bordeaux 1, 2010. http://www.theses.fr/2010BOR14090/document.
Full textIn this thesis, we are interested in various vertex coloring and homomorphism problems of graphs with special emphasis on planar graphs and sparsegraphs. We consider proper vertex coloring, acyclic coloring, star coloring, forestcoloring, fractional coloring and the list version of most of these concepts.In Chapter 2, we consider the problem of finding sufficient conditions for a planargraph to be 3-choosable. These conditions are expressed in terms of forbiddensubgraphs and our results extend several known results.The notion of acyclic list coloring of planar graphs was introduced by Borodin,Fon-Der Flaass, Kostochka, Raspaud, and Sopena. They conjectured that everyplanar graph is acyclically 5-choosable. In Chapter 3, we obtain some sufficientconditions for planar graphs to be acyclically k-choosable with k 2 f3; 4; 5g.In Chapter 4, we prove that every subcubic graph is 6-star-colorable. On theother hand, Fertin, Raspaud and Reed showed that the Wagner graph cannot be5-star-colorable. This fact implies that our result is best possible. Moreover, weobtain new upper bounds on star choosability of planar subcubic graphs with givengirth.A k-forest-coloring of a graph G is a mapping ¼ from V (G) to the set f1; ¢ ¢ ¢ ; kgsuch that each color class induces a forest. The vertex-arboricity of G is the smallestinteger k such that G has a k-forest-coloring. In Chapter 5, we prove a conjecture ofRaspaud and Wang asserting that every planar graph without intersecting triangleshas vertex-arboricity at most 2.Finally, in Chapter 6, we focus on the homomorphism problems of sparse graphsto the Petersen graph. More precisely, we prove that every triangle-free graph withmaximum average degree less than 5=2 admits a homomorphism to the Petersengraph. Moreover, we show that the bound on the maximum average degree in ourresult is best possible
Coelho, Angela Mello. "Comparação de métodos de estimação de componentes de variância e parâmetros genéticos considerando o delineamento III aplicado a caracteres quantitativos em milho." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/11/11134/tde-19042010-105020/.
Full textThis work aimed to compare estimation methods for variance components and genetic parameters, considering the factorial statistical design set in randomized blocks and the genetic Design III. As reference, three sets of real data were used, on maize genetic improvement, related to the characters: grain yield (grams by plot), plant height, measured from the ground to the °ag leaf in centimeters, and the number of leaves above the uppermost ear. The analysis of variance method (ANOVA), accordingly to the proposed by the Design III, was used on the analysis of the data and estimation of the variance components derived from the mathematical model, genetic variances, heritability and average degree of dominance for each of the studied characters. This estimatives were used on the simulation of 1000 data sets with similar characteristics to the real data analyzed. The ANOVA and restricted maximum likelihood (REML) methods were used on the prediction of the already mentioned parameters for each of the simulated data sets within each character. The 1000 estimatives obtained by each method, for each studied character, were used on the calculation of descriptive statistics (mean, standard deviation and relative accuracy) and for the ¯tting of box-plot graphics. Through the information obtained from the estimatives given by each method and in possession of the actual values that they should predict (values used in the simulation of the data sets) it was possible to compare both methods as to the e±ciency of the estimatives given by them. Both methods presented similar characteristics on the prediction of most of the variance components derived from the mathematical model, being that most di®erences were pertinent to the components related to the e®ects of progeny (¾2 p) and to the interactions between progeny and parental inbred (¾2 pt) and between progeny, parental inbred and environment (¾2 pta); which are the components of greater importance on the calculation of the genetic parameters. The ANOVA method was very e±cient on the prediction of ¾2 p, being that the smaller the reference value for this component, more the REML method approached the results obtained by the ANOVA method; for larger values of ¾2 pt the most e±cient was the REML method, but its e±ciency decayed and approached the ANOVA method for smaller reference values for this component. Both methods were poorly e±cient on the prediction of ¾2 pta, but the REML method was the least e±cient. The better performance of the ANOVA method on the prediction of the variance components of greater importance on the calculation of the genetic variances lead to a better performance of the ANOVA method on the prediction of all genetic parameters, with exception to the dominance variance, which depended solely on ¾2 pt. However, it was observed a tendency on the ANOVA method, in average, on the overestimation of the average degree of dominance of around 45% of the actual reference value, independently of the studied character.
Bashar, Mohammad. "Average case analysis of algorithms for the maximum subarray problem : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Computer Science in the University of Canterbury /." 2007. http://library.canterbury.ac.nz/etd/adt-NZCU20071024.010106.
Full textNikjah, Reza. "Performance evaluation and protocol design of fixed-rate and rateless coded relaying networks." Phd thesis, 2010. http://hdl.handle.net/10048/1674.
Full textCommunications
Books on the topic "Maximum average degree"
Skiba, Grzegorz. Fizjologiczne, żywieniowe i genetyczne uwarunkowania właściwości kości rosnących świń. The Kielanowski Institute of Animal Physiology and Nutrition, Polish Academy of Sciences, 2020. http://dx.doi.org/10.22358/mono_gs_2020.
Full textBook chapters on the topic "Maximum average degree"
Jacques, Fabien, and Alexandre Pinlou. "The Chromatic Number of Signed Graphs with Bounded Maximum Average Degree." In Trends in Mathematics, 657–62. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83823-2_105.
Full textBourgeois, Nicolas, Bruno Escoffier, Vangelis Th Paschos, and Johan M. M. van Rooij. "Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$." In Lecture Notes in Computer Science, 373–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13562-0_34.
Full textSkrobala, Viktor, and Sofiya Marutyak. "PECULIARITIES OF THE TERRITORY OF THE CITY OF LVIV (UKRAINE) AND THEIR INFLUENCE ON THE HYDROLOGICAL REGIME AND EROSION PROCESSES." In European vector of development of the modern scientific researches. Publishing House “Baltija Publishing”, 2021. http://dx.doi.org/10.30525/978-9934-26-077-3-28.
Full textKandra, Ranju, and Sunil Bajpai. "Wound Dressing Application of Ch/CD Nanocomposite Film." In Chitin and Chitosan - Physicochemical Properties and Industrial Applications [Working Title]. IntechOpen, 2021. http://dx.doi.org/10.5772/intechopen.95107.
Full textKelly, Eugene F., and Caroline M. Yonker. "Soil Development and Distribution in the Shortgrass Steppe Ecosystem." In Ecology of the Shortgrass Steppe. Oxford University Press, 2008. http://dx.doi.org/10.1093/oso/9780195135824.003.0007.
Full textSingh, Anuj Kumar, Jayanta Kumar Pati, Shiva Kumar Patil, Wolf Uwe Reimold, Arun Kumar Rao, and Om Prakash Pandey. "Anisotropy of magnetic susceptibility (AMS) of impact melt breccia and target rocks from the Dhala impact structure, India." In Large Meteorite Impacts and Planetary Evolution VI. Geological Society of America, 2021. http://dx.doi.org/10.1130/2021.2550(14).
Full textBlamey, Peter J. "The Expected Benefit of Hearing Aids in Quiet as a Function of Hearing Thresholds." In Advances in Medical Technologies and Clinical Practice, 63–85. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8191-8.ch004.
Full textYung, Yuk L., and William B. DeMore. "Earth: Imprint of Life." In Photochemistry of Planetary Atmospheres. Oxford University Press, 1999. http://dx.doi.org/10.1093/oso/9780195105018.003.0012.
Full text"demonstration, see fig. 7. Gas is released at the emission point x = 30 m, y = 15 m and z = 2 m at a volume rate of 400 m3/h; this volume rate is required in summertime per unit of livestock (in German: GroBvieheinheit, 1 GV = 500 kg live weight) for ventilation of pighouses; Tt is an average measure. Fig. 7 shows the isopleths of the dimensionsless concentration ratio C/C at the immission level z = 3 m. The mean wind speed U is 2,6m/s. The arrows give the range of the altering wind direction; the mean wind direction is 161 degree. At the source we have C/C0 = 10\ A maximum of nondimensional concentration is found in the downwind distance of about 30 m from the point source. 60 ^ 30 15 0 15 30 £5 m 60." In Odour Prevention and Control of Organic Sludge and Livestock Farming, 122. CRC Press, 1986. http://dx.doi.org/10.1201/9781482286311-45.
Full textConference papers on the topic "Maximum average degree"
Qiu, Baojian, Jihui Wang, Yan Liu, and Zhenyu Xu. "Neighbor Sum Distinguishing Total Colorings of Graphs with Bounded Maximum Degree and Maximum Average Degree." In 2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC). IEEE, 2017. http://dx.doi.org/10.1109/cse-euc.2017.182.
Full textOnus, Melih, and Andréa W. Richa. "Parameterized Maximum and Average Degree Approximation in Topic-Based Publish-Subscribe Overlay Network Design." In 2010 IEEE 30th International Conference on Distributed Computing Systems. IEEE, 2010. http://dx.doi.org/10.1109/icdcs.2010.54.
Full textLebassi, B., J. E. Gonza´lez, R. Bornstein, and D. Fabris. "Spatial and Temporal Changes in Climatological Degree-Days in California." In ASME 2007 Energy Sustainability Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/es2007-36205.
Full textFarhang, K., D. Y. Hua, P. Wang, and Y. Li. "An Assessment of Statistical Theory of Contact Between Macroscopically Conforming Rough Surfaces." In World Tribology Congress III. ASMEDC, 2005. http://dx.doi.org/10.1115/wtc2005-63309.
Full textOruç, Sertaç. "Climate Extreme Indices Derived from Observed Daily Temperature Data Over Three Cities of Thrace Region, Turkey." In 4th International Conference of Contemporary Affairs in Architecture and Urbanism – Full book proceedings of ICCAUA2020, 20-21 May 2021. Alanya Hamdullah Emin Paşa University, 2021. http://dx.doi.org/10.38027/iccaua2021107n1.
Full textCarvalho de Castro, Henrique, and Bruno Henrique Groenner Barbosa. "Multi-gene Genetic Programming for Structure Selection of Polynomial NARMAX models." In Congresso Brasileiro de Automática - 2020. sbabra, 2020. http://dx.doi.org/10.48011/asba.v2i1.1384.
Full textDhanasekaran, T. S., and Ting Wang. "CFD Model Validation and Prediction of Mist/Steam Cooling in a 180-Degree Bend Tubes." In 2010 14th International Heat Transfer Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/ihtc14-22833.
Full textRong, Xin, and Hongwu Zhu. "Erosion Prediction of Sub-Sea Xmas Tree Based on CFD." In ASME 2020 Pressure Vessels & Piping Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/pvp2020-21016.
Full textDwivedi, Anjali, Ankit Verma, and S. Sarkar. "Flow and Heat Transfer Analysis of Mist-Film Cooling on a Flat Plate." In ASME 2017 Gas Turbine India Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/gtindia2017-4568.
Full textShrivastava, Devashish, Lance DelaBarre, Timothy Hanson, and J. Thomas Vaughan. "Improved MR Thermometry to Measure Brain Temperatures." In ASME 2008 Summer Bioengineering Conference. American Society of Mechanical Engineers, 2008. http://dx.doi.org/10.1115/sbc2008-192017.
Full text