Artykuły w czasopismach na temat „Maximum Size Matching”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Maximum Size Matching”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.
Cameron, Kathie, and Tracy Walker. "The graphs with maximum induced matching and maximum matching the same size." Discrete Mathematics 299, no. 1-3 (2005): 49–55. http://dx.doi.org/10.1016/j.disc.2004.07.022.
Pełny tekst źródłaNoureen, Sadia, and Bhatti Ahmad. "The modified first Zagreb connection index and the trees with given order and size of matchings." Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics 13, no. 2 (2021): 85–94. http://dx.doi.org/10.5937/spsunp2102085n.
Pełny tekst źródłaCannas, Massimo, and Emiliano Sironi. "Optimal Matching with Matching Priority." Analytics 3, no. 1 (2024): 165–77. http://dx.doi.org/10.3390/analytics3010009.
Pełny tekst źródłaErdős, Péter L., Shubha R. Kharel, Tamás Róbert Mezei, and Zoltán Toroczkai. "New Results on Graph Matching from Degree-Preserving Growth." Mathematics 12, no. 22 (2024): 3518. http://dx.doi.org/10.3390/math12223518.
Pełny tekst źródłaPálvölgyi, Dömötör. "Partitioning to three matchings of given size is NP-complete for bipartite graphs." Acta Universitatis Sapientiae, Informatica 6, no. 2 (2014): 206–9. http://dx.doi.org/10.1515/ausi-2015-0004.
Pełny tekst źródłaKeslassy, I., Rui Zhang-Shen, and N. McKeown. "Maximum size matching is unstable for any packet switch." IEEE Communications Letters 7, no. 10 (2003): 496–98. http://dx.doi.org/10.1109/lcomm.2003.817330.
Pełny tekst źródłaRhee, Wansoo T. "A concentration inequality for maximum matching size in random graphs1." Optimization 21, no. 5 (1990): 797–803. http://dx.doi.org/10.1080/02331939008843608.
Pełny tekst źródłaKobler, Daniel, and Udi Rotics. "Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size." Algorithmica 37, no. 4 (2003): 327–46. http://dx.doi.org/10.1007/s00453-003-1035-4.
Pełny tekst źródłaPlummer, Michael D., and Akira Saito. "Forbidden subgraphs and bounds on the size of a maximum matching." Journal of Graph Theory 50, no. 1 (2005): 1–12. http://dx.doi.org/10.1002/jgt.20087.
Pełny tekst źródłaKlemz, Boris, and Günter Rote. "Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs." Algorithmica 84, no. 4 (2022): 1064–80. http://dx.doi.org/10.1007/s00453-021-00904-w.
Pełny tekst źródłaKuz'min, Nikita Aleksandrovich, and Dmitriy Sergeevich Malyshev. "On diameter $5$ trees with the maximum number of matchings." Sbornik: Mathematics 214, no. 2 (2023): 273–84. http://dx.doi.org/10.4213/sm9745e.
Pełny tekst źródłaZhang, H., S. Liu, Z. Ye, et al. "EFFECT OF IMAGE MATCHING WINDOW SIZE ON SATELLITE JITTER FREQUENCY DETECTION." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLIII-B1-2020 (August 6, 2020): 149–55. http://dx.doi.org/10.5194/isprs-archives-xliii-b1-2020-149-2020.
Pełny tekst źródłaZhang, Huajun. "On the maximum size of subfamilies of labeled set with given matching number." Journal of Combinatorial Optimization 38, no. 4 (2019): 1296–304. http://dx.doi.org/10.1007/s10878-019-00451-9.
Pełny tekst źródłaBABENKO, MAXIM, ALEXEY GUSAKOV, and ILYA RAZENSHTEYN. "TRIANGLE-FREE 2-MATCHINGS REVISITED." Discrete Mathematics, Algorithms and Applications 02, no. 04 (2010): 643–54. http://dx.doi.org/10.1142/s1793830910000930.
Pełny tekst źródłaSharma, Isha, and Jagjeet Jakhar. "Restricted size Ramsey numbers and restricted size Ramsey minimal graphs for matching versus wheel upto order six." Journal of Interdisciplinary Mathematics 27, no. 2 (2024): 171–80. http://dx.doi.org/10.47974/jim-1807.
Pełny tekst źródłaDas, Shibsankar. "An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs." Scientific Annals of Computer Science XXX, no. 1 (2020): 25–37. https://doi.org/10.7561/SACS.2020.1.25.
Pełny tekst źródłaSonnenberg, FA, MH Eckman, and SG Pauker. "Bone marrow donor registries: the relation between registry size and probability of finding complete and partial matches [see comments]." Blood 74, no. 7 (1989): 2569–78. http://dx.doi.org/10.1182/blood.v74.7.2569.2569.
Pełny tekst źródłaSonnenberg, FA, MH Eckman, and SG Pauker. "Bone marrow donor registries: the relation between registry size and probability of finding complete and partial matches [see comments]." Blood 74, no. 7 (1989): 2569–78. http://dx.doi.org/10.1182/blood.v74.7.2569.bloodjournal7472569.
Pełny tekst źródłaHenning, Michael A., and Anders Yeo. "Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph." Graphs and Combinatorics 23, no. 6 (2007): 647–57. http://dx.doi.org/10.1007/s00373-007-0757-5.
Pełny tekst źródłaBIRÓ, PÉTER, DAVID F. MANLOVE, and ROMEO RIZZI. "MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS." Discrete Mathematics, Algorithms and Applications 01, no. 04 (2009): 499–517. http://dx.doi.org/10.1142/s1793830909000373.
Pełny tekst źródłaZhao, Jin-Hua. "A local algorithm and its percolation analysis of bipartite z-matching problem." Journal of Statistical Mechanics: Theory and Experiment 2023, no. 5 (2023): 053401. http://dx.doi.org/10.1088/1742-5468/acd105.
Pełny tekst źródłaFRANKL, PETER, VOJTECH RÖDL, and ANDRZEJ RUCIŃSKI. "On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size." Combinatorics, Probability and Computing 21, no. 1-2 (2012): 141–48. http://dx.doi.org/10.1017/s0963548311000496.
Pełny tekst źródłaKosowski, Adrian, Michał Małafiejski, and Paweł Żyliński. "Tighter Bounds on the Size of a Maximum P 3-Matching in a Cubic Graph." Graphs and Combinatorics 24, no. 5 (2008): 461–68. http://dx.doi.org/10.1007/s00373-008-0807-7.
Pełny tekst źródłaJin, 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 (2018): 1850021. http://dx.doi.org/10.1142/s1793830918500210.
Pełny tekst źródłaFeng, Yongde, Yanting Xie, Fengxia Liu, and Shoujun Xu. "The Extendability of Cayley Graphs Generated by Transposition Trees." Mathematics 10, no. 9 (2022): 1575. http://dx.doi.org/10.3390/math10091575.
Pełny tekst źródłaShi, Chao, and Tianlong Ma. "A note on maximum size of a graph without isolated vertices under the given matching number." Applied Mathematics and Computation 460 (January 2024): 128295. http://dx.doi.org/10.1016/j.amc.2023.128295.
Pełny tekst źródłaGÜNTHER, MANUEL, and ROLF P. WÜRTZ. "FACE DETECTION AND RECOGNITION USING MAXIMUM LIKELIHOOD CLASSIFIERS ON GABOR GRAPHS." International Journal of Pattern Recognition and Artificial Intelligence 23, no. 03 (2009): 433–61. http://dx.doi.org/10.1142/s0218001409007211.
Pełny tekst źródłaHOPPEN, CARLOS, YOSHIHARU KOHAYAKAWA, and HANNO LEFMANN. "Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size." Combinatorics, Probability and Computing 21, no. 1-2 (2012): 203–18. http://dx.doi.org/10.1017/s0963548311000484.
Pełny tekst źródłaArezoomand, Majid, and Mohsen Ghasemi. "Normality of one-matching semi-Cayley graphs over finite abelian groups with maximum degree 3." Contributions to Discrete Mathematics 15, no. 3 (2020): 75–87. http://dx.doi.org/10.55016/ojs/cdm.v15i3.62247.
Pełny tekst źródłaGolovkov, A. A., and E. I. Mozhaeva. "Limiting Characteristics for Receiving Small Size Frame Antenna Matching Using Converter Negative Impedance." Journal of the Russian Universities. Radioelectronics, no. 1 (April 17, 2018): 32–37. http://dx.doi.org/10.32603/1993-8985-2018-21-1-32-37.
Pełny tekst źródłaLEE, D. T., and MAJID SARRAFZADEH. "MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS." International Journal of Computational Geometry & Applications 03, no. 03 (1993): 291–304. http://dx.doi.org/10.1142/s021819599300018x.
Pełny tekst źródłaMartin, Ryan R., and Balázs Patkós. "A Note on the Erdős Matching Conjecture." Studia Scientiarum Mathematicarum Hungarica 62, no. 1 (2025): 63–69. https://doi.org/10.1556/012.2025.04330.
Pełny tekst źródłaLi, Yanjia, and Sophie Spirkl. "The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size." Discrete Mathematics 346, no. 4 (2023): 113342. http://dx.doi.org/10.1016/j.disc.2023.113342.
Pełny tekst źródłaSingh, Sukhjit, Dr V.K Jain, and Dr Amanpreet Singh. "A novel LSB steganographic method using partition and matching algorithms." International Journal of Engineering & Technology 7, no. 4 (2018): 7079–85. http://dx.doi.org/10.14419/ijet.v7i4.22273.
Pełny tekst źródłaBahadır, Selim. "Graphs with Total Domination Number Double of the Matching Number." Journal of New Theory, no. 49 (December 31, 2024): 1–6. https://doi.org/10.53570/jnt.1520557.
Pełny tekst źródłaStoecklin, Sebastian, Adnan Yousaf, Gunnar Gidion, Leonhard Reindl, and Stefan J. Rupitsch. "Simultaneous Power Feedback and Maximum Efficiency Point Tracking for Miniaturized RF Wireless Power Transfer Systems." Sensors 21, no. 6 (2021): 2023. http://dx.doi.org/10.3390/s21062023.
Pełny tekst źródłaBahadur, Saloni, Rashmee Shrestha, Yalapi Sumaharshini, Gnv Ravi Teja, and Kalpitha N. "LITERATURE REVIEW ON VARIOUS DEPTH ESTIMATION METHODS FOR AN IMAGE." International Journal of Research -GRANTHAALAYAH 5, no. 4RACSIT (2017): 8–13. http://dx.doi.org/10.29121/granthaalayah.v5.i4racsit.2017.3342.
Pełny tekst źródłaAKUTSU, TATSUYA. "ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES." International Journal of Foundations of Computer Science 17, no. 04 (2006): 903–17. http://dx.doi.org/10.1142/s0129054106004170.
Pełny tekst źródłaHe, Xin Sheng, Zuo Cai Dai, Chun Fu Gao, and Shao Tai Deng. "Research of Matching Power for Photovoltaic Charging Control System." Key Engineering Materials 620 (August 2014): 220–24. http://dx.doi.org/10.4028/www.scientific.net/kem.620.220.
Pełny tekst źródłaLucibello, C., and F. Ricci-Tersenghi. "The Statistical Mechanics of Random Set Packing and a Generalization of the Karp-Sipser Algorithm." International Journal of Statistical Mechanics 2014 (March 10, 2014): 1–13. http://dx.doi.org/10.1155/2014/136829.
Pełny tekst źródłaZhang, Li Ping, Yao Fu Zhu, and Zhong Fan. "Research and Simulation of Photovoltaic System MPPT Control Based on Fuzzy Algorithm." Advanced Materials Research 740 (August 2013): 164–69. http://dx.doi.org/10.4028/www.scientific.net/amr.740.164.
Pełny tekst źródłaWang, Dayong, Jiahao Meng, Jie Zhao, et al. "Full-Aperture Reflective Remote Fourier Ptychography with Sample Matching." Remote Sensing 16, no. 22 (2024): 4276. http://dx.doi.org/10.3390/rs16224276.
Pełny tekst źródłaJiao, Yuxin, Zhikun Lin, Long Yu, and Xiaozhu Wu. "A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing." ISPRS International Journal of Geo-Information 11, no. 3 (2022): 203. http://dx.doi.org/10.3390/ijgi11030203.
Pełny tekst źródłaBonnet, Xavier, François Brischoux, Marine Briand, and Richard Shine. "Plasticity matches phenotype to local conditions despite genetic homogeneity across 13 snake populations." Proceedings of the Royal Society B: Biological Sciences 288, no. 1943 (2021): 20202916. http://dx.doi.org/10.1098/rspb.2020.2916.
Pełny tekst źródłaChiba, Shuya, and Yuji Nakano. "Remarks on upper and lower bounds formatching sequencibility of graphs." Filomat 30, no. 8 (2016): 2091–99. http://dx.doi.org/10.2298/fil1608091c.
Pełny tekst źródłaLiu, Mengyin, Chao Zhu, Jun Wang, and Xu-Cheng Yin. "Adaptive Pattern-Parameter Matching for Robust Pedestrian Detection." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 3 (2021): 2154–62. http://dx.doi.org/10.1609/aaai.v35i3.16313.
Pełny tekst źródłaKim, Jihoon, Seoungyoon Han, Bo-Bae Kim, Mun-Kyo Lee, and Bok-Hyung Lee. "Millimeter-Wave GaN High-Power Amplifier MMIC Design Guideline Considering a Source via Effect." Electronics 13, no. 13 (2024): 2616. http://dx.doi.org/10.3390/electronics13132616.
Pełny tekst źródłaDuppala, Sharmila, Nathaniel Grammel, Juan Luque, Calum MacRury, and Aravind Srinivasan. "Proportionally Fair Matching via Randomized Rounding." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 16 (2025): 16435–43. https://doi.org/10.1609/aaai.v39i16.33805.
Pełny tekst źródłaMa, Chao, Hongjiang Wu, Xudong Lu, and Haitao Sun. "Research and Design of X-band Low Noise Amplifier Based on CMOS Process." Journal of Physics: Conference Series 2108, no. 1 (2021): 012102. http://dx.doi.org/10.1088/1742-6596/2108/1/012102.
Pełny tekst źródłaZhou, M., L. S. Chen, J. H. Wang, et al. "ANALYSIS OF INFLUENCING FACTORS OF CURVE MATCHING BASED GEOMETRIC CALIBRATION FOR ZY3-02 ALTIMETER DATA." ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences IV-2/W7 (September 16, 2019): 221–26. http://dx.doi.org/10.5194/isprs-annals-iv-2-w7-221-2019.
Pełny tekst źródła