Relevant bibliographies by topics / Maximum Size Matching

Contents

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

Academic literature on the topic 'Maximum Size Matching'

Author: Grafiati
Published: 6 September 2023
Last updated: 31 July 2025

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 'Maximum Size Matching.'

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 Size Matching"

1

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.

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

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.

Full text
Abstract:
A subset of the edge set of a graph G is called a matching in G if its elements are not adjacent in G. A matching in G with the maximum cardinality among all the matchings in G is called a maximum matching. The matching number in the graph G is the number of elements in the maximum matching of G. This present paper is devoted to the investigation of the trees, which maximize the modified first Zagreb connection index among the trees with a given order and matching number.
APA, Harvard, Vancouver, ISO, and other styles
3

Cannas, Massimo, and Emiliano Sironi. "Optimal Matching with Matching Priority." Analytics 3, no. 1 (2024): 165–77. http://dx.doi.org/10.3390/analytics3010009.

Full text
Abstract:
Matching algorithms are commonly used to build comparable subsets (matchings) in observational studies. When a complete matching is not possible, some units must necessarily be excluded from the final matching. This may bias the final estimates comparing the two populations, and thus it is important to reduce the number of drops to avoid unsatisfactory results. Greedy matching algorithms may not reach the maximum matching size, thus dropping more units than necessary. Optimal matching algorithms do ensure a maximum matching size, but they implicitly assume that all units have the same matching
APA, Harvard, Vancouver, ISO, and other styles
4

Erdő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.

Full text
Abstract:
The recently introduced model in S. R. Kharel et al.’s study [Degree-preserving network growth. Nature Physics 2022, 18, 100–106] uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence. The process depends both on the size of the largest available matching, which is the focus of this paper, as well as on the actual choice of the matching. Here, we first show that the question of whether a graphic degree sequence, extended with a new degree 2δ, remains graphic is equivalent to the existence of a realization of the original degree seq
APA, Harvard, Vancouver, ISO, and other styles
5

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 (2014): 206–9. http://dx.doi.org/10.1515/ausi-2015-0004.

Full text
Abstract:
Abstract We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned into three matchings, of size k1, k2 and k3 is NP-complete, even if one of the matchings is required to be perfect. We also show that the problem of deciding whether the edge set of a simple graph contains a perfect matching and a disjoint matching of size k or not is NP-complete, already for bipartite graphs with maximum degree 3. It also follows from our construction that it is NP-complete to decide whether in a bipartite graph there is a perfect matching and a disjoint matching that co
APA, Harvard, Vancouver, ISO, and other styles
6

Keslassy, 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.

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

Rhee, 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.

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

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 (2003): 327–46. http://dx.doi.org/10.1007/s00453-003-1035-4.

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

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.

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

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 (2022): 1064–80. http://dx.doi.org/10.1007/s00453-021-00904-w.

Full text
Abstract:
AbstractA bipartite graph $$G=(U,V,E)$$ G = ( U , V , E ) is convex if the vertices in V can be linearly ordered such that for each vertex $$u\in U$$ u ∈ U , the neighbors of u are consecutive in the ordering of V. An induced matchingH of G is a matching for which no edge of E connects endpoints of two different edges of H. We show that in a convex bipartite graph with n vertices and mweighted edges, an induced matching of maximum total weight can be computed in $$O(n+m)$$ O ( n + m ) time. An unweighted convex bipartite graph has a representation of size O(n) that records for each vertex $$u\
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Maximum Size Matching"

1

Mohan, Avinash. "On Reduced-State Optimal Scheduling for Decentralized Medium Access Control of Wireless Data Collection Networks." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5452.

Full text
Abstract:
In the Internet of Things (IoT), devices such as sensors and actuators will almost invariably be connected to the Internet via wireless networks. The sensor and actuator devices in such systems will be resource challenged with constraints on the energy available to them, and on their computing, storage, and communication capabilities. Hence, the control strategies in such systems should be light-weight, and decentralised, requiring very little information exchange. With these observations in mind, the central theme of the work reported in this thesis is the development of wireless schedul
APA, Harvard, Vancouver, ISO, and other styles
2

Sidibé, Abdoul Karim. "Three essays in microeconomic theory." Thesis, 2020. http://hdl.handle.net/1866/24659.

Full text
Abstract:
Cette thèse est un recueil de trois articles sur la théorie microéconomique. Les deux premiers traitent de la question de la course vers le bas lorsque les gouvernements se livrent à la concurrence pour certains facteurs mobiles. Le troisième article propose une extension du problème d'appariement plusieurs-à-un en y introduisant des agents de tailles différentes. Dans le premier article, nous montrons comment le résultat standard de course vers le bas (race-to-the-bottom) peut être évité en introduisant du bien public dans un modèle de compétition fiscale. Notre économie comporte deux jurid
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Maximum Size Matching"

1

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.

Full text
Abstract:
The landmark paper discussed in this chapter is ‘Gabapentin for the treatment of postherpetic neuralgia: A randomized controlled trial’, published by Rowbotham et al. in 1998. In the study, a 4-week initial period of titration of gabapentin (up to a maximum of 3,600 mg) or matching placebo was given, followed by a further 4-week period at the maximum tolerated dose. The primary efficacy measure was change in average daily pain score from start to finish of the treatment, and secondary measures observed were the average daily sleep score, a short-form McGill Pain Questionnaire, the subject’s gl
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Maximum Size Matching"

1

Behnezhad, Soheil. "Dynamic Algorithms for Maximum Matching Size." In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 2023. http://dx.doi.org/10.1137/1.9781611977554.ch6.

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

Nikolopoulos, Stavros D., and Leonidas Palios. "Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching." In Advances in Informatics. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11573036_7.

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

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. Society for Industrial and Applied Mathematics, 2020. http://dx.doi.org/10.1137/1.9781611975994.107.

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

Blanton, Marina, and Siddharth Saraph. "Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification." In Computer Security -- ESORICS 2015. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24174-6_20.

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

Abdi, Ahmad, Gérard Cornuéjols, Siyue Liu, and Olha Silina. "Strongly Connected Orientations and Integer Lattices." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-93112-3_1.

Full text
Abstract:
Abstract Let $$D\,=\,(V,A)$$ D = ( V , A ) be a digraph whose underlying graph is 2-edge-connected, and let P be the polytope whose vertices are the incidence vectors of arc sets whose reversal makes D strongly connected. We study the lattice theoretic properties of the integer points contained in a proper face F of P not contained in $$\{x:x_a=i\}$$ { x : x a = i } for any $$a\in A,i\in \{0,1\}$$ a ∈ A , i ∈ { 0 , 1 } . We prove under a mild necessary condition that $$F\cap \{0,1\}^A$$ F ∩ { 0 , 1 } A contains an integral basis B, i.e., B is linearly independent, and any integral vector in th
APA, Harvard, Vancouver, ISO, and other styles
6

"Size and structure of maximum matchings." In Matching Theory. American Mathematical Society, 2009. http://dx.doi.org/10.1090/chel/367/03.

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

Karpinski, Marek, and Wojciech Rytter. "Combinatorial tools." In Fast Parallel Algorithms for Graph Matching Problems. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198501626.003.0002.

Full text
Abstract:
Abstract Recall that MatchNum(G) is the size (number of edges) of a maximum cardinality matching of a graph G = (V, E) and a perfect matching is a matching of size IVl/2. There are two basic combinatorial tools needed to compute this number: augmenting paths (to construct a matching of a maximal size k); witness sets (to provide an NC-proof that there is no matching of size larger thank). Almost all efficient sequential algorithms use augmenting paths, contrary to NC¬ algorithms. On the other hand witness sets are not used frequently in sequential computations but they are needed in parallel r
APA, Harvard, Vancouver, ISO, and other styles
8

Karpinski, Marek, and Wojciech Rytter. "Maximum cardinality matchings." In Fast Parallel Algorithms for Graph Matching Problems. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198501626.003.0006.

Full text
Abstract:
Abstract In this chapter we use algebraic tools (in particular parallel interpolation algorithms for large polynomials) to find maximum cardinality matchings in undirected graphs. We explore the correspondence between graphs and some black-box polynomials (Tutte’s symbolic polynomials). The crucial point is the use of determinants instead of permanents. There are NC-algorithms to compute determinants but there is a good chance (and our general belief) that there does not exist even a polynomial time sequential algorithm to compute permanents. Recall that A(n) denotes the number of processors n
APA, Harvard, Vancouver, ISO, and other styles
9

Bažant, Zdeněk P., Jia-Liang Le, and Marco Salviato. "Energetic Size Effect in Quasibrittle Fracture." In Quasibrittle Fracture Mechanics and Size Effect. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192846242.003.0005.

Full text
Abstract:
The energetic size effect, transitioning from ductile behavior at small structure sizes to brittle behavior at large ones, is a quintessential feature of all quasibrittle fracture. Its analytical law, recently adopted for ACI Standard 318, is important for safe and efficient structural design. First it is explained that, in absence of any material characteristic length, which is the case for both elasticity and LEFM, the scaling of structural strength must be a power law of structure size. Its particular form is derived from dimensional analysis. After establishing the second-order asymptotic
APA, Harvard, Vancouver, ISO, and other styles
10

Shen Gang and Zhang Yun. "A Multi-agent Approach to the Maximum Weight Matching Problem." In Advances in Transdisciplinary Engineering. IOS Press, 2014. https://doi.org/10.3233/978-1-61499-440-4-162.

Full text
Abstract:
The maximum weight matching (MWM) for bipartite graphs is a fundamental combinatorial optimization problem that can be found extensively in many engineering applications such as job assignment and resource allocation. The traditional solution to MWM requires all weights to be collected on a centralized entity. In this paper, we present a multi-agent approach to solving MWM by message passing among all involved agents in a concurrent way. The proposed distributed algorithm is motivated by two related factors: first, in certain circumstances no server is available to provide centralized services
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Maximum Size Matching"

1

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. Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974782.113.

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

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.

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

Winick, K. A., and P. Kumar. "Spatial mode matching efficiencies for heterodyned GaAlAs semiconductor lasers." In OSA Annual Meeting. Optica Publishing Group, 1987. http://dx.doi.org/10.1364/oam.1987.tux5.

Full text
Abstract:
The performance of an optical heterodyne receiver is strongly influenced by the degree to which the signal and local oscillator beams can be spatially matched in both amplitude and phase at the detector. Any mismatch reduces the IF signal power and consequently the SNR. The ratio of IF signal power obtained in the presence of a mismatch to that obtained when there is no mismatch is referred to as the spatial mode matching efficiency. Several authors have performed theoretical studies to determine the mode matching efficiency as a function of system parameters, including signal/local oscillator
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
Stereo images are images formed from two or more sources that capture the same scene so that it is possible to infer the depth of the scene under analysis. The use of convolutional neural networks to compute these images has been shown to be a viable alternative due to its speed in finding the correspondence between the images. This raises questions related to the influence of structural parameters, such as size of kernel, stride and pooling policy on the performance of the neural network. To this end, this work sought to reproduce an article that deals with the topic and to explore the influe
APA, Harvard, Vancouver, ISO, and other styles
5

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}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/265.

Full text
Abstract:
We propose a new and strengthened Branch-and-Bound (BnB) algorithm for the maximum common (connected) induced subgraph problem based on two new operators, Long-Short Memory (LSM) and Leaf vertex Union Match (LUM). Given two graphs for which we search for the maximum common (connected) induced subgraph, the first operator of LSM maintains a score for the branching node using the short-term reward of each vertex of the first graph and the long-term reward of each vertex pair of the two graphs. In this way, the BnB process learns to reduce the search tree size significantly and boost the algorith
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
Abstract:
This paper presents the ratchet limit analysis of a pipe with a symmetric crack in a mismatched weld by using the extended Linear Matching Method (LMM). Two loading conditions are considered: i) a cyclic temperature load and a constant internal pressure; and ii) a cyclic temperature load and a constant axial tension. Individual effects of i) the geometry of the Weld Metal (WM), ii) the size of the crack, iii) the location of the crack and iv) the yield stress of WM on the ratchet limits, maximum temperature ranges to avoid ratchetting and limit loads are investigated. Influence functions of th
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
Three-dimensional measurements of bubble size, and velocity are presented along with the associated statistics for dilute bubbly flow in a vertical pipe. These measurements were obtained through a combination of precise index-of-refraction matching and a stereoscopic high-speed imaging system. An image-processing algorithm has been developed and used to extract instantaneous bubble size, shape, velocity and trajectory information and statistics corrected for magnification errors (maximum of 2%). The experiments have been conducted at a Reynolds of 14,600 in vertical pipe-flow and a volumetric
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
Abstract:
Abstract For gas turbines with free power turbines, the capacity or flow parameter matching is of prime importance. Accurately matched capacity enables the gas turbine to run at its optimum conditions. This ensures maximum component efficiencies, and optimum shaft speeds within mechanical limits. This paper presents the challenges, uncertainties, and opportunities associated with an accurate matching of a generic two-shaft aeroderivative HP-LP gas generator with the free power turbine. Additionally, generic performance trends, uncertainty quantification, and results from the verification progr
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
A compact flow boiling module was developed for cooling a 100-W class package of about one-inch square in size. The cold plate, where heat is transferred from the package was made with a porous plating inside to augment boiling heat transfer. Heat transfer increased by a maximum of 50 percent when an organic refrigerant HFE-7100 was used, while the conditions for heat rejection to the ambient were kept unchanged. The heat rejection was achieved with an 80-mm fan with a matching corrugated fin radiator, whose effectiveness limits the overall size of the cooling module. The microscopic structure
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
The development of optimized fitting body armor is critical to the fightability and protection of our warfighters and first responders. Body armor systems generally worn by warfighters consists of three protective portions: rigid plates, a soft armor insert, and a carrier/vest. Rigid plates are inserted into the front, back, and sides of the body armor to provide a higher level of protection for the wearer, while the soft armor is positioned behind the plates and in areas of the body where a lower level of protection is acceptable or required for mobility and comfort. Previously, a comprehensi
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Maximum Size Matching' for particular source types:
Journal articles
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