Relevant bibliographies by topics / Weighted graphs coloring

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Weighted graphs coloring'

Author: Grafiati
Published: 4 June 2021
Last updated: 5 February 2022

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 'Weighted graphs coloring.'

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 "Weighted graphs coloring"

1

Obata, Yuji, and Takao Nishizeki. "Generalized edge-colorings of weighted graphs." Discrete Mathematics, Algorithms and Applications 08, no. 01 (2016): 1650015. http://dx.doi.org/10.1142/s1793830916500154.

Full text
Abstract:
Let [Formula: see text] be a graph with a positive integer weight [Formula: see text] for each vertex [Formula: see text]. One wishes to assign each edge [Formula: see text] of [Formula: see text] a positive integer [Formula: see text] as a color so that [Formula: see text] for any vertex [Formula: see text] and any two edges [Formula: see text] and [Formula: see text] incident to [Formula: see text]. Such an assignment [Formula: see text] is called an [Formula: see text]-edge-coloring of [Formula: see text], and the maximum integer assigned to edges is called the span of [Formula: see text].
APA, Harvard, Vancouver, ISO, and other styles
2

HUC, FLORIAN. "WEIGHTED-EDGE-COLORING OF k-DEGENERATE GRAPHS AND BIN-PACKING." Journal of Interconnection Networks 12, no. 01n02 (2011): 109–24. http://dx.doi.org/10.1142/s0219265911002861.

Full text
Abstract:
The weighted-edge-coloring problem of an edge-weighted graph whose weights are between 0 and 1, consists in finding a coloring using as few colors as possible and satisfying the following constraints: the sum of weights of edges with the same color and incident to the same vertex must be at most 1. In 1991, Chung and Ross conjectured that if G is bipartite, then [Formula: see text] colors are always sufficient to weighted-edge-color (G,w), where [Formula: see text] is the maximum of the sums of the weights of the edges incident to a vertex. We prove this is true for edge-weighted graphs with m
APA, Harvard, Vancouver, ISO, and other styles
3

BERMOND, JEAN-CLAUDE, FRÉDÉRIC HAVET, FLORIAN HUC, and CLÁUDIA LINHARES SALES. "IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS." Discrete Mathematics, Algorithms and Applications 02, no. 03 (2010): 395–411. http://dx.doi.org/10.1142/s1793830910000747.

Full text
Abstract:
We study a weighted improper coloring problem motivated by a frequency allocation problem. It consists of associating to each vertex a set of p(v) (weight) distinct colors (frequencies), such that the set of vertices having a given color induces a graph of degree at most k (the case k = 0 corresponds to proper coloring). The objective is to minimize the number of colors. We propose approximation algorithms to compute such a coloring for general graphs. We apply these to obtain good approximation ratio for grid and hexagonal graphs. Furthermore we give exact results for the 2-dimensional grid a
APA, Harvard, Vancouver, ISO, and other styles
4

HUC, FLORIAN, CLÁUDIA LINHARES SALES, and HERVÉ RIVANO. "THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS." Discrete Mathematics, Algorithms and Applications 04, no. 03 (2012): 1250028. http://dx.doi.org/10.1142/s1793830912500280.

Full text
Abstract:
In this paper, we consider a new edge coloring problem to model call scheduling optimization issues in wireless mesh networks: the proportional coloring. It consists in finding a minimum cost edge coloring of a graph which preserves the proportion given by the weights associated to each of its edges. We show that deciding if a weighted graph admits a proportional coloring is pseudo-polynomial while determining its proportional chromatic index is NP-hard. We then give lower and upper bounds for this parameter that can be computed in pseudo-polynomial time. We finally identify a class of graphs
APA, Harvard, Vancouver, ISO, and other styles
5

Guan, D. J., and Zhu Xuding. "A coloring problem for weighted graphs." Information Processing Letters 61, no. 2 (1997): 77–81. http://dx.doi.org/10.1016/s0020-0190(97)00002-1.

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

Hsu, Hsiang-Chun, and Gerard Jennhwa Chang. "Max-Coloring of Vertex-Weighted Graphs." Graphs and Combinatorics 32, no. 1 (2015): 191–98. http://dx.doi.org/10.1007/s00373-015-1562-1.

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

Wang, Yiyuan, Shaowei Cai, Shiwei Pan, Ximing Li, and Monghao Yin. "Reduction and Local Search for Weighted Graph Coloring Problem." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 03 (2020): 2433–41. http://dx.doi.org/10.1609/aaai.v34i03.5624.

Full text
Abstract:
The weighted graph coloring problem (WGCP) is an important extension of the graph coloring problem (GCP) with wide applications. Compared to GCP, where numerous methods have been developed and even massive graphs with millions of vertices can be solved well, fewer works have been done for WGCP, and no solution is available for solving WGCP for massive graphs. This paper explores techniques for solving WGCP, including a lower bound and a reduction rule based on clique sampling, and a local search algorithm based on two selection rules and a new variant of configuration checking. This results in
APA, Harvard, Vancouver, ISO, and other styles
8

Pikies, Tytus, and Marek Kubale. "Chromatic cost coloring of weighted bipartite graphs." Applied Mathematics and Computation 375 (June 2020): 125073. http://dx.doi.org/10.1016/j.amc.2020.125073.

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

Boz, Betul, and Gizem Sungu. "Integrated Crossover Based Evolutionary Algorithm for Coloring Vertex-Weighted Graphs." IEEE Access 8 (2020): 126743–59. http://dx.doi.org/10.1109/access.2020.3008886.

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

de Werra, D., M. Demange, B. Escoffier, J. Monnot, and V. Th Paschos. "Weighted coloring on planar, bipartite and split graphs: Complexity and approximation." Discrete Applied Mathematics 157, no. 4 (2009): 819–32. http://dx.doi.org/10.1016/j.dam.2008.06.013.

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

Dissertations / Theses on the topic "Weighted graphs coloring"

1

Zacharopoulos, Panagiotis [Verfasser]. "Asymmetric game perfect graphs and the circular coloring game of weighted graphs / Panagiotis Zacharopoulos. Fakultät für Mathematik." Bielefeld : Universitätsbibliothek Bielefeld, Hochschulschriften, 2012. http://d-nb.info/1024640639/34.

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

Diouf, Boubacar. "Decoupled approaches to register and software controlled memory allocations." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00769403.

Full text
Abstract:
Despite the benefit of the memory hierarchy, it is still essential, in order to reduce accesses to higher levels of memory, to have an efficient usage of registers and local memories (also called scratchpad memories) present in most embedded processors, graphical processors (GPUs) and network processors. During the compilation, from a source language to an executable code, there are two optimizations that are of utmost importance: the register allocation and the local memory allocation. In this thesis's report we are interested in decoupled approaches, solving separately the allocation and ass
APA, Harvard, Vancouver, ISO, and other styles
3

Han-WeiChan and 詹涵薇. "Weighted Graph Coloring Based Softer Pilot Reusefor TDD Massive MIMO Systems." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/f63t3n.

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

Book chapters on the topic "Weighted graphs coloring"

1

de Werra, Dominique, Mare Demange, Bruno Escoffier, Jerome Monnot, and Vangelis Th Paschos. "Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation." In Algorithms and Computation. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30551-4_76.

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

Benkoczi, Robert, Ram Dahal, and Daya Ram Gaur. "Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44543-4_27.

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

Obata, Yuji, and Takao Nishizeki. "Edge-Colorings of Weighted Graphs." In WALCOM: Algorithms and Computation. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-15612-5_4.

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

Demange, Marc, D. de Werra, J. Monnot, and Vangelis Th Paschos. "Weighted Node Coloring: When Stable Sets Are Expensive." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36379-3_11.

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

Zhou, Xiao, and Takao Nishizeki. "Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs." In Algorithms and Computation. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45678-3_44.

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

Jiang, Yanjun, and Xueyan Song. "A Weight-Based Graph Coloring Approach to Airport Gate Assignment Problem." In Intelligent Computing Theories. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39479-9_27.

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

Wu, Jingli, Dan Huang, Jinyan Wang, Yuanxiu Liao, and Jianbo Lu. "Viral Quasispecies Spectrum Reconstruction via Coloring the Vertex in the Weighted Read Conflict Graph." In Proceedings of the 2nd International Conference on Healthcare Science and Engineering. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6837-0_1.

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

Zhang, Yating, and Tao Peng. "Tier-Based Directed Weighted Graph Coloring Algorithm for Device-to-Device Underlay Cellular Networks." In Communications and Networking. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-41117-6_5.

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

Belhabib, Abdelfettah, Mohamed Boulouird, and Moha M’Rabet Hassani. "Outer Weighted Graph Coloring Strategy to Mitigate the Problem of Pilot Contamination in Massive MIMO Systems." In Advances on Smart and Soft Computing. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-6048-4_49.

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

Bao, Yuanyuan, Shubin Wang, Bingxin Yan, Kun Liu, and Fangfang Meng. "Research on Maximal Weighted Independent Set-Based Graph Coloring Spectrum Allocation Algorithm in Cognitive Radio Networks." In Proceedings of the 2015 International Conference on Communications, Signal Processing, and Systems. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49831-6_27.

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

Conference papers on the topic "Weighted graphs coloring"

1

Correa, José R., and Michel X. Goemans. "An approximate König's theorem for edge-coloring weighted bipartite graphs." In the thirty-sixth annual ACM symposium. ACM Press, 2004. http://dx.doi.org/10.1145/1007352.1007417.

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

Sungu, Gizem, and Betul Boz. "An Evolutionary Algorithm for Weighted Graph Coloring Problem." In GECCO '15: Genetic and Evolutionary Computation Conference. ACM, 2015. http://dx.doi.org/10.1145/2739482.2768488.

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

Chang, Wenson, and Han-Wei Chan. "Weighted graph coloring based softer pilot reuse for TDD massive MIMO systems." In 2018 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2018. http://dx.doi.org/10.1109/wcnc.2018.8377094.

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

Anis, Abdelrahman A. H., Bassant Abdelhamid, and Salwa Elramly. "Low Overhead Weighted-Graph-Coloring-Based Two-Layer Precoding for FDD Massive MIMO Systems." In 2018 9th International Conference on Computing, Communication and Networking Technologies (ICCCNT). IEEE, 2018. http://dx.doi.org/10.1109/icccnt.2018.8493782.

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

Hernandez, Hugo, and Christian Blum. "Distributed graph coloring in wireless ad hoc networks: A light-weight algorithm based on Japanese tree frogs' calling behaviour." In 2011 4th Joint IFIP Wireless and Mobile Networking Conference (WMNC). IEEE, 2011. http://dx.doi.org/10.1109/wmnc.2011.6097216.

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!

To the bibliography