Добірка наукової літератури з теми "Maximum Size Matching"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Maximum Size Matching".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Maximum Size Matching"
Cameron, Kathie, and Tracy Walker. "The graphs with maximum induced matching and maximum matching the same size." Discrete Mathematics 299, no. 1-3 (August 2005): 49–55. http://dx.doi.org/10.1016/j.disc.2004.07.022.
Повний текст джерелаNoureen, 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.
Повний текст джерелаPá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 (December 1, 2014): 206–9. http://dx.doi.org/10.1515/ausi-2015-0004.
Повний текст джерелаKeslassy, I., Rui Zhang-Shen, and N. McKeown. "Maximum size matching is unstable for any packet switch." IEEE Communications Letters 7, no. 10 (October 2003): 496–98. http://dx.doi.org/10.1109/lcomm.2003.817330.
Повний текст джерелаRhee, Wansoo T. "A concentration inequality for maximum matching size in random graphs1." Optimization 21, no. 5 (January 1990): 797–803. http://dx.doi.org/10.1080/02331939008843608.
Повний текст джерелаKobler, 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 (May 28, 2003): 327–46. http://dx.doi.org/10.1007/s00453-003-1035-4.
Повний текст джерелаPlummer, 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.
Повний текст джерелаKlemz, 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 (January 6, 2022): 1064–80. http://dx.doi.org/10.1007/s00453-021-00904-w.
Повний текст джерелаKuz'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.
Повний текст джерелаZhang, H., S. Liu, Z. Ye, X. Tong, H. Xie, S. Zheng, and Q. Du. "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.
Повний текст джерелаДисертації з теми "Maximum Size Matching"
Sidibé, Abdoul Karim. "Three essays in microeconomic theory." Thesis, 2020. http://hdl.handle.net/1866/24659.
Повний текст джерелаThis thesis is a collection of three articles on microeconomic theory. The first two articles are concerned with the issue of race-to-the-bottom when governments engage in competition for some mobile factor. The third article proposes an extension for the many-to-one matching problem by introducing different-size agents. In the first article, we show how the standard race-to-the-bottom result can be avoided by introducing public good into a tax competition model. Our economy has two jurisdictions populated by perfectly mobile workers divided into two categories: skilled and unskilled. Governments, in pursuit of a Rawlsian objective (max-min), simultaneously announce their plans for investing in public good before deploying a nonlinear income tax schedule. After observing the tax schedules of the governments and their promises to invest in public good, each worker chooses a place of residence and a supply of labour. Thus, governments achieve their redistribution objectives by seeking to attract productive labour through the provision of public goods in addition to favorable taxation policy. We show that there exist equilibria where skilled workers pay a strictly positive tax. In addition, when information on the type of workers is private, there are equilibria for certain parameter values in which unqualified workers receive a net transfer (or subsidy) from the government. In the second article, we investigate how the Bertrand standard price competition with differentiated products could provide useful insight for Citizenship By Investment programs in the Caribbean. We show that when countries can be classified into two types according to the size of their demand, imposing appropriate uniform minimum price and maximum quota brings countries to an efficient outcome that Pareto dominates the Non-Cooperative Nash Equilibrium. Finally. in the third article, we explore an extension of the standard many-to-one matching problem by incorporating different-size agents (refugee families) on the many side of the market, to be assigned to entities (homes) with different capacities on the other side. A specific feature of this model is that it does not allow refugee families to be split between several homes. It is well known that many of the desirable properties of matching rules are unachievable in this framework. We introduce size-monotonic priority ranking over refugee families for each home, that is, a host family (home) would always prefer a greater number of members of refugee families until its capacity constraint binds. We show that a pairwise stable matching always exists under this assumption and we propose a mechanism to find it. We show that our mechanism is strategy-proof for refugees: no refugee family could benefit from misrepresenting his preferences. Our mechanism is also refugees optimal pairwise stable in the sense that there is no other pairwise stable mechanism that would be more profitable to all refugees.
Книги з теми "Maximum Size Matching"
Gupta, Rajesh. Randomized controlled trial evidence for gabapentin in post-herpetic neuralgia. Edited by Paul Farquhar-Smith, Pierre Beaulieu, and Sian Jagger. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780198834359.003.0069.
Повний текст джерелаЧастини книг з теми "Maximum Size Matching"
Behnezhad, Soheil. "Dynamic Algorithms for Maximum Matching Size." In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 129–62. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2023. http://dx.doi.org/10.1137/1.9781611977554.ch6.
Повний текст джерелаNikolopoulos, Stavros D., and Leonidas Palios. "Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching." In Advances in Informatics, 68–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11573036_7.
Повний текст джерелаKapralov, Michael, Slobodan Mitrović, Ashkan Norouzi-Fard, and Jakab Tardos. "Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples." In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1753–72. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2020. http://dx.doi.org/10.1137/1.9781611975994.107.
Повний текст джерелаBlanton, Marina, and Siddharth Saraph. "Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification." In Computer Security -- ESORICS 2015, 384–406. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24174-6_20.
Повний текст джерела"Size and structure of maximum matchings." In Matching Theory, 83–119. Providence, Rhode Island: American Mathematical Society, 2009. http://dx.doi.org/10.1090/chel/367/03.
Повний текст джерелаBažant, Zdeněk P., Jia-Liang Le, and Marco Salviato. "Energetic Size Effect in Quasibrittle Fracture." In Quasibrittle Fracture Mechanics and Size Effect, 112–39. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192846242.003.0005.
Повний текст джерела"Doing the experiment." In Muon Spectroscopy, edited by Stephen J. Blundell, Roberto De Renzi, Tom Lancaster, and Francis L. Pratt, 217–38. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198858959.003.0015.
Повний текст джерела"3 Size and Structure of Maximum Matchings." In North-Holland Mathematics Studies, 83–119. Elsevier, 1986. http://dx.doi.org/10.1016/s0304-0208(08)73639-9.
Повний текст джерелаТези доповідей конференцій з теми "Maximum Size Matching"
Assadi, Sepehr, Sanjeev Khanna, and Yang Li. "On Estimating Maximum Matching Size in Graph Streams." In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974782.113.
Повний текст джерелаHu, Shujing, Jinyuan Sehn, Runjie Liu, Wenying Zhang, and Weixin Mu. "Maximum Size Matching Method Realized by Hopfield Neural Network for ATM cell scheduling." In 2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop (KAM 2008 Workshop). IEEE, 2008. http://dx.doi.org/10.1109/kamw.2008.4810566.
Повний текст джерелаWinick, K. A., and P. Kumar. "Spatial mode matching efficiencies for heterodyned GaAlAs semiconductor lasers." In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1987. http://dx.doi.org/10.1364/oam.1987.tux5.
Повний текст джерелаPonce, João Pedro Poloni, and Ricardo Suyama. "Study of Convolutional Neural Networks applied to Image Stereo Matching." In Conference on Graphics, Patterns and Images. Sociedade Brasileira de Computação, 2020. http://dx.doi.org/10.5753/sibgrapi.est.2020.13005.
Повний текст джерелаZhou, Jianrong, Kun He, Jiongzhi Zheng, Chu-Min Li, and Yanli Liu. "A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/265.
Повний текст джерелаNikitopoulos, D. E., J. Fiedler, M. Dowden, and E. Evans. "Bubble Size Effects on Dispersed Phase Motion in Vertical Bubbly Pipe Flow." In ASME/JSME 2003 4th Joint Fluids Summer Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/fedsm2003-45553.
Повний текст джерелаLi, Tianbai, Haofeng Chen, Weihang Chen, and James Ure. "Ratchet Limits for a Crack in a Welded Pipe Subjected to a Cyclic Temperature Load and a Constant Mechanical Load." In ASME 2011 Pressure Vessels and Piping Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/pvp2011-57046.
Повний текст джерелаThirumurthy, Deepak, Jose Carlos Casado Coca, and Kanishka Suraweera. "Capacity Matching of Aeroderivative Gas Generator With Free Power Turbine: Challenges, Uncertainties, and Opportunities." In ASME Turbo Expo 2019: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/gt2019-90617.
Повний текст джерелаSakamoto, Hitoshi, and Kazuyuki Mikubo. "Closed-Loop Flow Boiling Module With a Plated Heat Sink." In ASME 2007 InterPACK Conference collocated with the ASME/JSME 2007 Thermal Engineering Heat Transfer Summer Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/ipack2007-33260.
Повний текст джерелаChoi-Rokas, Hyegjoo, Todd Garlie, and K. Blake Mitchell. "Theoretical Framework for the Sizing of Body Armor Plates to Optimize Fit." In 13th International Conference on Applied Human Factors and Ergonomics (AHFE 2022). AHFE International, 2022. http://dx.doi.org/10.54941/ahfe1001898.
Повний текст джерела