Статті в журналах з теми "Edge coloring problem"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Edge coloring problem".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Li and Yu. "New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling." Algorithms 12, no. 7 (July 16, 2019): 142. http://dx.doi.org/10.3390/a12070142.
Повний текст джерела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 (August 6, 2012): 1250028. http://dx.doi.org/10.1142/s1793830912500280.
Повний текст джерелаHoppen, Carlos, and Hanno Lefmann. "Remarks on an Edge-coloring Problem." Electronic Notes in Theoretical Computer Science 346 (August 2019): 511–21. http://dx.doi.org/10.1016/j.entcs.2019.08.045.
Повний текст джерелаBourgeois, N., G. Lucarelli, I. Milis, and V. Th Paschos. "Approximating the max-edge-coloring problem." Theoretical Computer Science 411, no. 34-36 (July 2010): 3055–67. http://dx.doi.org/10.1016/j.tcs.2010.04.031.
Повний текст джерелаHUC, FLORIAN. "WEIGHTED-EDGE-COLORING OF k-DEGENERATE GRAPHS AND BIN-PACKING." Journal of Interconnection Networks 12, no. 01n02 (March 2011): 109–24. http://dx.doi.org/10.1142/s0219265911002861.
Повний текст джерелаMertzios, George B., Hendrik Molter, and Viktor Zamaraev. "Sliding Window Temporal Graph Coloring." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 7667–74. http://dx.doi.org/10.1609/aaai.v33i01.33017667.
Повний текст джерелаLarjomaa, Tommi, and Alexandru Popa. "The Min-Max Edge q-Coloring Problem." Journal of Graph Algorithms and Applications 19, no. 1 (2015): 507–28. http://dx.doi.org/10.7155/jgaa.00373.
Повний текст джерелаLucarelli, Giorgio, Ioannis Milis, and Vangelis T. Paschos. "On the max-weight edge coloring problem." Journal of Combinatorial Optimization 20, no. 4 (March 14, 2009): 429–42. http://dx.doi.org/10.1007/s10878-009-9223-z.
Повний текст джерелаFaudree, R. J., Andr�as Gy�rf�s, and R. H. Schelp. "An edge coloring problem for graph products." Journal of Graph Theory 23, no. 3 (November 1996): 297–302. http://dx.doi.org/10.1002/(sici)1097-0118(199611)23:3<297::aid-jgt9>3.0.co;2-n.
Повний текст джерелаTAMURA, HIROSHI, KAORU WATANABE, MASAKAZU SENGOKU, and SHOJI SHINODA. "A CHANNEL ASSIGNMENT PROBLEM IN MULTIHOP WIRELESS NETWORKS AND GRAPH THEORY." Journal of Circuits, Systems and Computers 13, no. 02 (April 2004): 375–85. http://dx.doi.org/10.1142/s0218126604001398.
Повний текст джерелаImreh, Csanád, and Judit Nagy-György. "Online hypergraph coloring with rejection." Acta Universitatis Sapientiae, Informatica 7, no. 1 (June 1, 2015): 5–17. http://dx.doi.org/10.1515/ausi-2015-0009.
Повний текст джерелаJin, Zemin, Kun Ye, He Chen, and Yuefang Sun. "Large rainbow matchings in semi-strong edge-colorings of graphs." Discrete Mathematics, Algorithms and Applications 10, no. 02 (April 2018): 1850021. http://dx.doi.org/10.1142/s1793830918500210.
Повний текст джерелаSKULRATTANAKULCHAI, SAN, and HAROLD N. GABOW. "COLORING ALGORITHMS ON SUBCUBIC GRAPHS." International Journal of Foundations of Computer Science 15, no. 01 (February 2004): 21–40. http://dx.doi.org/10.1142/s0129054104002285.
Повний текст джерелаZhou, Yangyang, Dongyang Zhao, Mingyuan Ma, and Jin Xu. "Domination Coloring of Graphs." Mathematics 10, no. 6 (March 21, 2022): 998. http://dx.doi.org/10.3390/math10060998.
Повний текст джерелаZhong, Chuang, and Shuangliang Tian. "Neighbor Sum Distinguishing Edge (Total) Coloring of Generalized Corona Product." Journal of Physics: Conference Series 2381, no. 1 (December 1, 2022): 012031. http://dx.doi.org/10.1088/1742-6596/2381/1/012031.
Повний текст джерелаCalamoneri, Tiziana, and Rossella Petreschi. "Edge-clique graphs and the lambda-coloring problem." Journal of the Brazilian Computer Society 7, no. 3 (2001): 38–47. http://dx.doi.org/10.1590/s0104-65002001000200006.
Повний текст джерелаOSAWA, Hiroki, Akira SUZUKI, Takehiro ITO, and Xiao ZHOU. "The Complexity of (List) Edge-Coloring Reconfiguration Problem." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101.A, no. 1 (2018): 232–38. http://dx.doi.org/10.1587/transfun.e101.a.232.
Повний текст джерелаCHEN, Qin. "Efficient algorithms for the edge-cover coloring problem." SCIENTIA SINICA Mathematica 46, no. 3 (March 1, 2016): 351–70. http://dx.doi.org/10.1360/012015-21.
Повний текст джерелаLee, Sang-Un. "A Polynomial Time Algorithm for Edge Coloring Problem." Journal of the Korea Society of Computer and Information 18, no. 11 (November 29, 2013): 159–65. http://dx.doi.org/10.9708/jksci.2013.18.11.159.
Повний текст джерелаLiu, Jia-Bao, Micheal Arockiaraj, and Antony Nelson. "Tight Bounds on 1-Harmonious Coloring of Certain Graphs." Symmetry 11, no. 7 (July 15, 2019): 917. http://dx.doi.org/10.3390/sym11070917.
Повний текст джерелаVikram, S. T., and S. Balaji. "An Analysis of the Factors Influencing the Strong Chromatic Index of Graphs Derived by Inflating a Few Common Classes of Graphs." Symmetry 15, no. 7 (June 23, 2023): 1301. http://dx.doi.org/10.3390/sym15071301.
Повний текст джерелаMaus, Yannic. "The power of locality: Exploring the limits of randomness in distributed computing." it - Information Technology 62, no. 5-6 (December 16, 2020): 271–78. http://dx.doi.org/10.1515/itit-2019-0051.
Повний текст джерелаDey, Arindam, Le Son, P. Kumar, Ganeshsree Selvachandran, and Shio Quek. "New Concepts on Vertex and Edge Coloring of Simple Vague Graphs." Symmetry 10, no. 9 (September 1, 2018): 373. http://dx.doi.org/10.3390/sym10090373.
Повний текст джерелаLestari, Dia, and I. Ketut Budayasa. "BILANGAN KETERHUBUNGAN PELANGI PADA PEWARNAAN-SISI GRAF." MATHunesa: Jurnal Ilmiah Matematika 8, no. 1 (April 23, 2020): 25–34. http://dx.doi.org/10.26740/mathunesa.v8n1.p25-34.
Повний текст джерелаLiang, Weifa. "Fast parallel algorithms for the approximate edge-coloring problem." Information Processing Letters 55, no. 6 (September 1995): 333–38. http://dx.doi.org/10.1016/0020-0190(95)00122-s.
Повний текст джерелаLucarelli, Giorgio, and Ioannis Milis. "Improved approximation algorithms for the Max Edge-Coloring problem." Information Processing Letters 111, no. 16 (August 2011): 819–23. http://dx.doi.org/10.1016/j.ipl.2011.05.019.
Повний текст джерелаCheng, Zhen, Zhihua Chen, Yufang Huang, Xuncai Zhang, and Jin Xu. "Implementation of the Timetable Problem Using Self-assembly of DNA Tiles." International Journal of Computers Communications & Control 5, no. 4 (November 1, 2010): 490. http://dx.doi.org/10.15837/ijccc.2010.4.2507.
Повний текст джерелаNAKANO, SHIN-ICHI, and TAKAO NISHIZEKI. "SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS." International Journal of Foundations of Computer Science 04, no. 02 (June 1993): 101–15. http://dx.doi.org/10.1142/s0129054193000079.
Повний текст джерелаMalyshev, D. S. "Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem." Diskretnyi analiz i issledovanie operatsii 27, no. 4 (November 30, 2020): 104–30. http://dx.doi.org/10.33048/daio.2020.27.682.
Повний текст джерелаXie, Xuzhen, Mutsunori Yagiura, Takao Ono, Tomio Hirata, and Uri Zwick. "An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem." Journal of Graph Algorithms and Applications 12, no. 4 (2008): 383–99. http://dx.doi.org/10.7155/jgaa.00171.
Повний текст джерелаAnanda, Rizky, Zulfahmi Indra, and Hamidah Nasution. "Application of Graph Coloring on Nurse Work Scheduling at H. Adam Malik Hospital Medan Using the Tabu Search Algorithm." ZERO: Jurnal Sains, Matematika dan Terapan 6, no. 1 (September 23, 2022): 1. http://dx.doi.org/10.30829/zero.v6i1.12451.
Повний текст джерелаMalyshev, D. S. "Complete Complexity Dichotomy for $$\boldsymbol 7 $$-Edge Forbidden Subgraphs in the Edge Coloring Problem." Journal of Applied and Industrial Mathematics 14, no. 4 (November 2020): 706–21. http://dx.doi.org/10.1134/s1990478920040092.
Повний текст джерелаDobrinen, Natasha. "The Ramsey theory of the universal homogeneous triangle-free graph." Journal of Mathematical Logic 20, no. 02 (January 28, 2020): 2050012. http://dx.doi.org/10.1142/s0219061320500129.
Повний текст джерелаNagarathinam, R., N. Parvathi, and . "Grundy Number of Some Chordal Graphs." International Journal of Engineering & Technology 7, no. 4.10 (October 2, 2018): 64. http://dx.doi.org/10.14419/ijet.v7i4.10.20708.
Повний текст джерелаBarenboim, Leonid, Michael Elkin та Uri Goldenberg. "Locally-iterative Distributed (Δ + 1)-coloring and Applications". Journal of the ACM 69, № 1 (28 лютого 2022): 1–26. http://dx.doi.org/10.1145/3486625.
Повний текст джерелаAsratian, A. S. "Some results on an edge coloring problem of Folkman and Fulkerson." Discrete Mathematics 223, no. 1-3 (August 2000): 13–25. http://dx.doi.org/10.1016/s0012-365x(00)00061-3.
Повний текст джерелаAdamaszek, Anna, and Alexandru Popa. "Approximation and hardness results for the maximum edge q-coloring problem." Journal of Discrete Algorithms 38-41 (May 2016): 1–8. http://dx.doi.org/10.1016/j.jda.2016.09.003.
Повний текст джерелаde Oliveira Contiero, Lucas, Carlos Hoppen, Hanno Lefmann, and Knut Odermann. "Stability of extremal hypergraphs with applications to an edge-coloring problem." Electronic Notes in Discrete Mathematics 61 (August 2017): 263–69. http://dx.doi.org/10.1016/j.endm.2017.06.047.
Повний текст джерелаBorghini, Fabrizio, Isabel Méndez-Díaz, and Paula Zabala. "An exact algorithm for the edge coloring by total labeling problem." Annals of Operations Research 286, no. 1-2 (July 25, 2018): 11–31. http://dx.doi.org/10.1007/s10479-018-2977-x.
Повний текст джерелаQuaddoura, Ruzayn. "On 2-Colorability Problem for Hypergraphs with P_8-free Incidence Graphs." International Arab Journal of Information Technology 17, no. 2 (February 28, 2019): 257–63. http://dx.doi.org/10.34028/iajit/17/2/14.
Повний текст джерелаArdelean, Sebastian Mihai, and Mihai Udrescu. "Graph coloring using the reduced quantum genetic algorithm." PeerJ Computer Science 7 (January 3, 2022): e836. http://dx.doi.org/10.7717/peerj-cs.836.
Повний текст джерелаYegnanarayanan, Venkataraman, Gayathri Yegnanarayanan, and Marius Balas. "On Coloring Catalan Number Distance Graphs and Interference Graphs." Symmetry 10, no. 10 (October 9, 2018): 468. http://dx.doi.org/10.3390/sym10100468.
Повний текст джерелаHebrard, Emmanuel, and George Katsirelos. "Constraint and Satisfiability Reasoning for Graph Coloring." Journal of Artificial Intelligence Research 69 (September 4, 2020): 33–65. http://dx.doi.org/10.1613/jair.1.11313.
Повний текст джерелаWang, Zhaocai, Zuwen Ji, Ziyi Su, Xiaoming Wang, and Kai Zhao. "Solving the maximal matching problem with DNA molecules in Adleman–Lipton model." International Journal of Biomathematics 09, no. 02 (January 14, 2016): 1650019. http://dx.doi.org/10.1142/s1793524516500194.
Повний текст джерелаCalamoneri, Tiziana. "Optimal L(j,k)-Edge-Labeling of Regular Grids." International Journal of Foundations of Computer Science 26, no. 04 (June 2015): 523–35. http://dx.doi.org/10.1142/s012905411550029x.
Повний текст джерелаJanczewski, Robert, and Michał Małafiejski. "On Efficient Coloring of Chordless Graphs." Decision Making in Manufacturing and Services 3, no. 2 (December 21, 2009): 5–14. http://dx.doi.org/10.7494/dmms.2009.3.2.5.
Повний текст джерелаPAUL, VIJI, and K. A. GERMINA. "ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE." Discrete Mathematics, Algorithms and Applications 04, no. 01 (March 2012): 1250003. http://dx.doi.org/10.1142/s1793830912500036.
Повний текст джерелаNgo, Hung Q., and Van H. Vu. "Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs." SIAM Journal on Computing 32, no. 4 (January 2003): 1040–49. http://dx.doi.org/10.1137/s0097539702408235.
Повний текст джерелаMatsumoto, Yusuke, Naoyuki Kamiyama, and Keiko Imai. "An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem." Information Processing Letters 111, no. 10 (April 2011): 465–68. http://dx.doi.org/10.1016/j.ipl.2011.02.006.
Повний текст джерелаSotskov, Yuri N., and Evangelina I. Mihova. "Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem." Algorithms 14, no. 8 (August 19, 2021): 246. http://dx.doi.org/10.3390/a14080246.
Повний текст джерела