It is commonly claimed that achieving maximum power from a thermoelectric generator necessitates electrical load matching conditions instead of the operating condition derived for maximum generator efficiency. Here we explain why the electrical load matching claim for maximum power in a design optimization is flawed and show that the load condition derived for maximum efficiency always produces...

In the thesis we focus on an algorithmic approach to one of many problems related to resource allocation. More precisely, its main result is a procedure for maintaining a maximum cardinality matching in a setting, where a part of the graph is revealed online, during the algorithm run. A matching M in a graph G = 〈V ,E〉 is any subset of edges M ⊆ E that are pairwise vertex-disjoint, i.e., each v...

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

Given a bipartite graph G = (A ∪ B, E) where each vertex ranks its neighbors in a strict order of preference, we consider the problem of computing a largest matching in the set of popular matchings in G. A matching M is said to be popular if there is no matching where more vertices are happier than in M . The set of popular matchings is non-empty since every stable matching is popular and it is...

In the semi-streaming model, an algorithm receives a stream of edges of a graph in arbitrary order and uses a memory of size O(npolylogn), where n is the number of vertices of a graph. In this work, we present semi-streaming algorithms that perform one or two passes over the input stream for Maximum Matching with no restrictions on the input graph, and for the important special case of bipartit...

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.

We characterize graphs H with the following property: Let G be a graph and F be a subgraph of G such that (i) each component of F is isomorphic to H or K2, (ii) the order of F is maximum. and (iii) the number of H-components in F is minimum subject to (ii). Then a maximum matching of F is also a maximum matching of G. This result is motivated by an analogous property of fractional matching disc...

A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.

A small baseline stereo matching method based on maximum like estimation is proposed. Firstly, the mixed window strategy is used to determine the matching window for each point in the reference image. Secondly, the normalized cross correlation function is employed to compute matching cost for possible matching points in the disparity range, then the “winner-take all” strategy is utilized to com...

We investigate the complexity of the Maximum Induced Matching problem on regular graphs and trees. The problem is shown to be NP-complete on regular graphs of degree 4s for any positive integer s. We also looks at very simple approximation algorithms: we show that the largest induced matching in a regular graph of degree d can be approximated with a performance ratio less than d. However a simp...