Temat: matching - Prolib Integro

Skocz do pozycji: 1.

Tytuł:: Mean value for the matching and dominating polynomial
Autorzy:: Arocha, Jorge
Llano, Bernardo
Tematy:: matching
matching polynomial
dominating set; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/743687.pdf Link otwiera się w nowym oknie
Opis:: The mean value of the matching polynomial is computed in the family of all labeled graphs with n vertices. We introduce the dominating polynomial of a graph whose coefficients enumerate the dominating sets for a graph and study some properties of the polynomial. The mean value of this polynomial is determined in a certain special family of bipartite digraphs.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: Aggregate Matching Function. The Case of Poland
Autorzy:: Roszkowska, Sylwia
Tematy:: matching function
matching effectiveness
unemployment duration; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:: https://bibliotekanauki.pl/articles/483241.pdf Link otwiera się w nowym oknie
Opis:: The main goal of this paper is to analyze the matching function in the Polish labour market in 1994-2008. Matching function is the relationship between outflows from unemployment to employment and the number of unemployed persons and vacancies as well as other variables which affect the efficiency of the matching process directly or indirectly. Such matching function in its augmented form is estimated here for Poland with the use of data from register of unemployed persons. The results indicate that there is a statistically stronger impact of the unemployed than vacancies on new hires. Furthermore, the institutional conditions of the labour market, the structure of the unemployed and the participants of active labour market programs (ALMP) play a role in the matching process.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Towards automatic skeleton extraction with skeleton grafting
Autorzy:: Grzegorzek, Marcin
Yang, Cong
See, John
Indurkhya, Bipin
Dostawca treści:: Repozytorium Uniwersytetu Jagiellońskiego

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: Extremal Matching Energy of Complements of Trees
Autorzy:: Wu, Tingzeng
Yan, Weigen
Zhang, Heping
Tematy:: matching polynomial
matching energy
Hosoya index
energy; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/31340889.pdf Link otwiera się w nowym oknie
Opis:: Gutman and Wagner proposed the concept of the matching energy which is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph. And they pointed out that the chemical applications of matching energy go back to the 1970s. Let $T$ be a tree with n vertices. In this paper, we characterize the trees whose complements have the maximal, second-maximal and minimal matching energy. Furthermore, we determine the trees with edge-independence number p whose complements have the minimum matching energy for $ p = 1, 2, . . ., \floor{ n/2 } $. When we restrict our consideration to all trees with a perfect matching, we determine the trees whose complements have the second-maximal matching energy.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 5.

Tytuł:: On maximum induced matching numbers of special grids
Autorzy:: Adefokun, T. C.
Ajayi, D. O.
Tematy:: induced matching
grid
maximum induced matching number
strong matching number
skojarzenie
krata
liczba skojarzona; Pokaż więcej
Wydawca:: Politechnika Rzeszowska im. Ignacego Łukasiewicza. Oficyna Wydawnicza
Powiązania:: https://bibliotekanauki.pl/articles/357751.pdf Link otwiera się w nowym oknie
Opis:: A subset M of the edge set of a graph G is an induced matching of $G$ if given any two edges $e_{1}; e_{2} \in M$, none of the vertices on $e_{1}$ is adjacent to any of the vertices on $e_{2}$. Suppose that $Max(G)$, a positive integer, denotes the maximum size of $M$ in $G$, then, $M$ is the maximum induced matching of $G$ and $Max(G)$ is the maximum induced matching number of $G$. In this work, we obtain upper bounds for the maximum induced matching number of grid $G = G_{n,m}, n \geq 9; m \equiv 3 \mod 4; m \geq 7, and nm$ odd.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: A Note on the Uniqueness of Stable Marriage Matching
Autorzy:: Drgas-Burchardt, Ewa
Tematy:: stable matching
Gale-Shapley model
stable perfect matching; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/30146858.pdf Link otwiera się w nowym oknie
Opis:: In this note we present some sufficient conditions for the uniqueness of a stable matching in the Gale-Shapley marriage classical model of even size. We also state the result on the existence of exactly two stable matchings in the marriage problem of odd size with the same conditions.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 7.

Tytuł:: Matching and Non-Matching Skills: Assessment and Searching for Ways to Balance
Autorzy:: Ilich, Liydmyla
Tematy:: labor market
skills
matching
non-matching
imbalance
anticipating; Pokaż więcej
Wydawca:: Instytut Studiów Międzynarodowych i Edukacji Humanum
Powiązania:: https://bibliotekanauki.pl/articles/2151126.pdf Link otwiera się w nowym oknie
Opis:: At the end of the previous century most world countries faced serious complex problems concerning of mismatching skills and jobs which were regarded as the crisis of educa- tional systems. The main cause of this crisis was intensification of contradictions between qualitative changes occurred in global society on the account of increase in demand for knowledge and intensification of its spreading and evolutionary and extensive education development. The problem of matching skills and jobs has become of actual importance since the mo- ment when the needs for labor force in developed countries increased. Employers called the need for skills as well as the need for employees eager to upgrade their knowledge constantly, get new skills and crucially new competences allowing them both to fulfill their duties successfully and create new workplaces independently. Nowadays the attention of scientific community is draws to estimation of matching skills and jobs as well as over- coming imbalances existing at the labor market. The article does a research into impact of skills anticipating on subjects of economy’s behavior and economy in general. Activities of workplace’s overeducation and undereducation in some European countries and Ukraine are analysed, the best practice of overcoming such imbalances is investigated.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 8.

Tytuł:: A minutiae-based matching algorithms in fingerprint recognition systems
Autorzy:: Więcław, Ł.
Tematy:: dopasowanie odciska
minutiae points
matching score
fingerprint matching; Pokaż więcej
Wydawca:: Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Powiązania:: https://bibliotekanauki.pl/articles/333023.pdf Link otwiera się w nowym oknie
Opis:: This study presents advantages of the most important methods of minutiae-based matching algorithm in fingerprint recognition systems. Minutia matching is the most popular approach to fingerprint identification and verification. Fingerprint matching usually consist of two procedures: minutia extraction and minutia matching. The performance mostly depends on the accuracy of the minutia extraction procedure. Minutiae matching designate the time complexity of applied solution.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 9.

Tytuł:: Maximum Semi-Matching Problem in Bipartite Graphs
Autorzy:: Katrenič, Ján
Semanišin, Gabriel
Tematy:: semi-matching
quasi-matching
bipartite graph
computational complexity; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/30146433.pdf Link otwiera się w nowym oknie
Opis:: An $(f, g)$-semi-matching in a bipartite graph $ G = (U \cup V, E) $ is a set of edges $ M \subseteq E $ such that each vertex $ u \in U $ is incident with at most $f(u)$ edges of $M$, and each vertex $v \in V$ is incident with at most $g(v)$ edges of $M$. In this paper we give an algorithm that for a graph with $n$ vertices and $m$ edges, $n \leq m$, constructs a maximum $(f, g)$-semi-matching in running time $O(m \cdot $ $ min\{ \sqrt{\Sigma_{u \in U} f(u)}, $ $ \sqrt{ \Sigma_{v \in V} g(v) } \})$. Using the reduction of [5] our result on maximum $(f, g)$-semi-matching problem directly implies an algorithm for the optimal semi-matching problem with running time $ O( \sqrt{n} m \log n ) $.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 10.

Tytuł:: A note on $PM$-compact bipartite graphs
Autorzy:: Liu, Jinfeng
Wang, Xiumei
Tematy:: perfect matching
PM-compact graph
matching-covered graph; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/31232003.pdf Link otwiera się w nowym oknie
Opis:: A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2 has an ear decomposition such that each graph in the decomposition sequence is also PM-compact, which implies that G is matching-covered
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "matching" wg kryterium: Temat