نتایج جستجو برای: maximal matching

تعداد نتایج: 187972  

Journal: :J. Economic Theory 2002
David Pérez-Castrillo Marilda Sotomayor

For the assignment game, we analyze the following mechanism: sellers, simultaneously, fix their prices first; then buyers, sequentially, decide which object to buy, if any, among the remaining objects. The first phase of the game determines the potential prices, while the second phase determines the actual matching. We prove that the set of subgame perfect equilibria in pure strategies in the s...

2011
Clemens Heuberger Stephan G. Wagner

We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) [Formula: see text] of a tree T of given order. While the trees that attain the lower bound are easily characterised, the trees with the largest number of maximum matchings show a very subtle structure. We give a complete characterisation of these trees and derive that the number of ...

Journal: :Discrete Mathematics 1996
Rudolf Ahlswede Levon H. Khachatrian

It is conjectured (and proved for edge sets of graphs) in [1] that in every family d of finite sets a subfamily ~ of disjoint sets (called a 'strongly maximal matching') exists, so that no replacement of k of them by more than k sets from a / resu l t s again in a subfamily of disjoint sets. As expected by Erd6s (Introduction of [2]), the conjecture is false. A counterexample is ag, the family ...

Journal: :J. Economic Theory 2007
Lars Ehlers

The following properties of the core of a one-to-one matching problem are well-known: (i) the core is non-empty; (ii) the core is a lattice; and (iii) the set of unmatched agents is identical for any two matchings belonging to the core. The literature on two-sided matching focuses almost exclusively on the core and studies extensively its properties. Our main result is the following characteriz...

Journal: :Inf. Process. Lett. 1981
Oscar H. Ibarra Shlomo Moran

Let G = (S, T, E) be a bipartite-graph, where S U T is the set of nodes (S n T = 8) and E is the set of edges, E c S X T. Let S = {ur , . . . . II,}, T = {VI, . . . . vt} (A t), and 1 E I= e. An (S, T) matching is a subset M of E such that no two edges in M have a common endpoint. A maximum matching is a matching of maximum cardinality. The set of nodes which take part in such a maximum matchin...

Journal: :Discrete Mathematics 2011
Cheng Yeaw Ku Kok Bin Wong

Recently, Bauer et al. (J Graph Theory 55(4) (2007), 343–358) introduced a graph operator D(G), called the D-graph of G, which has been useful in investigating the structural aspects of maximal Tutte sets in G with a perfect matching. Among other results, they proved a characterization of maximal Tutte sets in terms of maximal independent sets in the graph D(G) and maximal extreme sets in G. Th...

2008
Ron Aharoni Eli Berger Agelos Georgakopoulos Philipp Sprüssel

Given an assignment of weights w to the edges of an infinite graph G, a matching M in G is called strongly w-maximal if for any matching N there holds ∑ {w(e) | e ∈ N \ M} ≤ ∑ {w(e) | e ∈ M \ N}. We prove that if w assumes only finitely many values all of which are rational then G has a strongly w-maximal matching. This result is best possible in the sense that if we allow irrational values or ...

Journal: :ACM Transactions on Algorithms 2021

Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim provide guarantee expected. The strongest possible algorithm is it always correct (Las Vegas) and high...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->