نتایج جستجو برای: maximum matching
تعداد نتایج: 391300 فیلتر نتایج به سال:
A classical way of matching relational structures consists of finding a maximum clique in a derived “association graph.” However, it is not clear how to apply this approach to problems where the graphs are hierarchically organized, i.e. are trees, since maximum cliques are not constrained to preserve the partial order. We have recently provided a solution to this problem by constructing the ass...
let $gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. denote by $upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. in the classes of graphs $gamma_{n,kappa}$ and $upsilon_{n,beta}$, the elements having maximum augmented zagreb index are determined.
Edmonds d e veloped an efficient a lgorithm for finding in a given graph C a mat c hing of maximum cardinality. Thi s algorithm "s hrinks" part s of the graph C. Although helpful to the intuitive unde rstanding of the theory, s hrinking is compl icated to im plem e nt on an e l<!'c troni c comput e rThe modificati on presente d in thi s paper avoids s hrinking_ It e mploys ins tead a treelik e ...
We present a distributed algorithm that finds a matching M of size which is at least 2/3|M | where M ∗ is a maximum matching in a graph. The algorithm runs in O(log n) steps.
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first data structure that simultaneously achieves a constant approximation factor and handles a sequence of k updates in k · polylog(n) time. Previous data structures require a polynomial amount of ...
The analysis of time complexity of evolutionary algorithms has always focused on some artificial binary problems. This paper considers the average time complexity of an evolutionary algorithm for maximum cardinality matching in a graph. It is shown that the evolutionary algorithm can produce matchings with nearly maximum cardinality in average polynomial time.
We study the problem of fusing several reports about a group of objects into a single summary report, which best represents the received reports. A report is a list of labels associated with a group of objects, as reported by some identification device. Reports do not associate which object in the group has been given a specific label, the labels used in each report may be given in various leve...
The maximum weighted matching problem is to find a maximum matching in a given graph such that the sum of weights of edges in it is maximum. In this paper, the concept of maximum random fuzzy weighted matching is proposed firstly, and then the maximum random fuzzy weighted matching problem is formulated as expected value model, chance-constrained programming and dependent-chance programming acc...
This paper defines and studies a special kind of equilibrium termed as “balancing equilibrium” which arises in the power allocation game in [14]. The equilibrium has both unique mathematical property and realistic implications. In the equilibrium, all countries in antagonism have to use all of their own power to counteract the received threats, and the threat made to each adversary only equaliz...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید