scholarly journals Popular Matchings in Complete Graphs

Algorithmica ◽  
2021 ◽  
Author(s):  
Ágnes Cseh ◽  
Telikepalli Kavitha
Keyword(s):  
Complete Graph ◽  
The Other ◽  
Complete Graphs ◽  
Matching Problem ◽  
Graph Theoretic ◽  
The Given ◽  
Popular Matching

AbstractOur input is a complete graph G on n vertices where each vertex has a strict ranking of all other vertices in G. The goal is to construct a matching in G that is popular. A matching M is popular if M does not lose a head-to-head election against any matching $$M'$$ M ′ : here each vertex casts a vote for the matching in $$\{M,M'\}$$ { M , M ′ } in which it gets a better assignment. Popular matchings need not exist in the given instance G and the popular matching problem is to decide whether one exists or not. The popular matching problem in G is easy to solve for odd n. Surprisingly, the problem becomes $$\texttt {NP}$$ NP -complete for even n, as we show here. This is one of the few graph theoretic problems efficiently solvable when n has one parity and $$\texttt {NP}$$ NP -complete when n has the other parity.

Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP

1996 ◽  
Vol 5 (3) ◽  
pp. 297-306 ◽  
Author(s):  
Rachid Saad
Keyword(s):  
Complete Graph ◽  
Strong Evidence ◽  
General Setting ◽  
Maximum Length ◽  
Sufficient Condition ◽  
Complete Graphs ◽  
Random Polynomial ◽  
Exact Matching ◽  
Matching Problem ◽  
Bipartite Tournament

Jackson [10] gave a polynomial sufficient condition for a bipartite tournament to contain a cycle of a given length. The question arises as to whether deciding on the maximum length of a cycle in a bipartite tournament is polynomial. The problem was considered by Manoussakis [12] in the slightly more general setting of 2-edge coloured complete graphs: is it polynomial to find a longest alternating cycle in such coloured graphs? In this paper, strong evidence is given that such an algorithm exists. In fact, using a reduction to the well known exact matching problem, we prove that the problem is random polynomial.

scholarly journals Parameterized Problems Related to Seidel's Switching

2011 ◽  
Vol Vol. 13 no. 2 (Graph and Algorithms) ◽  
Author(s):  
Eva Jelinkova ◽  
Ondrej Suchy ◽  
Petr Hlineny ◽  
Jan Kratochvil
Keyword(s):  
Minimum Degree ◽  
The Other ◽  
Complete Graphs ◽  
Maximum Likelihood Decoding ◽  
Induced Subgraph ◽  
Fixed Parameter Tractable ◽  
Graph Theoretic ◽  
Np Completeness ◽  
Fixed Parameter ◽  
International Audience

Graphs and Algorithms International audience Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other by a sequence of switches. In this paper, we continue the study of computational complexity aspects of Seidel's switching, concentrating on Fixed Parameter Complexity. Among other results we show that switching to a graph with at most k edges, to a graph of maximum degree at most k, to a k-regular graph, or to a graph with minimum degree at least k are fixed parameter tractable problems, where k is the parameter. On the other hand, switching to a graph that contains a given fixed graph as an induced subgraph is W [1]-complete. We also show the NP-completeness of switching to a graph with a clique of linear size, and of switching to a graph with small number of edges. A consequence of the latter result is the NP-completeness of Maximum Likelihood Decoding of graph theoretic codes based on complete graphs.

scholarly journals Balanced Avoidance Games on Random Graphs

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Martin Marciniszyn ◽  
Dieter Mitsche ◽  
Miloš Stojaković
Keyword(s):  
Random Graphs ◽  
Complete Graph ◽  
Optimal Strategy ◽  
Random Order ◽  
The Other ◽  
Threshold Function ◽  
Graph Theoretic ◽  
International Audience ◽  
Balanced Coloring ◽  
Monochromatic Copy

International audience We introduce and study balanced online graph avoidance games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with $n$ vertices are revealed two at a time in a random order. In each move, Painter immediately and irrevocably decides on a balanced coloring of the new edge pair: either the first edge is colored red and the second one blue or vice versa. His goal is to avoid a monochromatic copy of a given fixed graph $H$ in both colors for as long as possible. The game ends as soon as the first monochromatic copy of $H$ has appeared. We show that the duration of the game is determined by a threshold function $m_H = m_H(n)$. More precisely, Painter will asymptotically almost surely (a.a.s.) lose the game after $m = \omega (m_H)$ edge pairs in the process. On the other hand, there is an essentially optimal strategy, that is, if the game lasts for $m = o(m_H)$ moves, then Painter will a.a.s. successfully avoid monochromatic copies of H using this strategy. Our attempt is to determine the threshold function for certain graph-theoretic structures, e.g., cycles.

The acquisition of Hungarian recursive PPs

2018 ◽  
Vol 4 (1) ◽  
pp. 105-123
Author(s):  
Ágnes Langó-Tóth
Keyword(s):  
Language Acquisition ◽  
Functional Element ◽  
The Other ◽  
Functional Head ◽  
Experiment Subject ◽  
The Given

Abstract In this study an experiment is presented on how Hungarian children interpret two word orders of recursive PPs (subject-PP-verb and PP-subject-verb order). According to the research of Roeper (2011) and Hollebrandse and Roeper (2014), children tend to give conjunctive interpretation to multiple embedded sentences at the beginning of language acquisition. This interpretation later turns into an adult-like, recursive interpretation. Our aim is to discover (i) whether Hungarian children start with conjunction as well, and whether (ii) the apparently more salient functional head lévő appearing in Hungarian recursive PPs can help them to acquire the correct, recursive interpretation early. We also want to find out whether (iii) the word orders in recursive PPs have an influence on the acquisition of children. In this paper two experiments are presented conducted with 6 and 8-year-olds and adults, in which the participants were asked to choose between two pictures. One of the pictures depicted recursive and the other one depicted conjunctive interpretation of the given sentence. In the first experiment subject-PP-verb order was tested, but in the second one sentences were tested with PP-subject-verb order. We will claim that lévő, which is (arguably) a more salient Hungarian functional element than -i, does not help children to acquire the embedded reading of recursive sentences, because both of them are overt functional heads. However, the two types of word orders affect the acquisition of recursive PPs. PP-subject-verb order is easier to compute because the order of the elements in the sentences and the order of the elements in the pictures matches.

Growth Characteristics of Activated Sludges Acclimated to para-Nitrophenol in Batch and Continuous Modes

1994 ◽  
Vol 29 (7) ◽  
pp. 327-333
Author(s):  
Y. Matsui ◽  
F. Yamaguchi ◽  
Y. Suwa ◽  
Y. Urushigawa
Keyword(s):  
Growth Characteristics ◽  
The Other ◽  
Operational Mode ◽  
Continuous Mode ◽  
Relative Resistance ◽  
Batch Mode ◽  
The Given ◽  
Operational Modes ◽  
Very High ◽  
Sensitive Group

Activated sludges were acclimated to p-nitrophenol (PNP) in two operational modes, a batch and a continuous. The operational mode of the PNP acclimation of activated sludges strongly affected the physiological characteristics of predominant microorganisms responsible for PNP degradation. Predominant PNP degraders in the sludge in batch mode (Sludge B) had lower PNP affinity and were relatively insensitive to PNP concentration. Those of the sludge in continuous mode (Sludge C), on the other hand, had very high PNP affinity and were sensitive to PNP. MPN enumeration of PNP degraders in sludge B and C using media with different PNP concentrations (0.05, 0.2,0.5 and 2.0 mM) supported the above results. Medium with 0.2 mM of PNP did not recover PNP degraders in sludge C well, while it recovered PNP degraders in sludge B as well as the medium with 0.05 mM did. When switching from one operational mode to the other, the predominant population in sludge B shifted to the sensitive group, but that of sludge C did not shift at the given loading of PNP, showing relative resistance to inhibitive concentration.

Giving and Promising

2018 ◽  
Author(s):  
Jean-Yves Lacoste ◽  
Oliver O’Donovan
Keyword(s):  
The Other ◽  
Face To Face ◽  
Present Experience ◽  
The World ◽  
The Given

Giving and promise must be thought together. Being-in-the world entails being-with the other, who is both “given” and bearer of a gift promised. But any disclosure may be understood as a gift; it is not anthropomorphic to speak of “self-giving” with a wider reference than person-to-person disclosure. Which implies that no act of giving can exhaust itself in its gift. Present experience never brings closure to self-revealing. Yet giving is crystallized into “the given,” the closure of gift. “The given” is what it is, needing no gift-event to reveal it. But the given, too, is precarious, and can be destabilized when giving brings us face to face with something unfamiliar. Nothing appears without a promise of further appearances, and God himself can never be “given.”

scholarly journals Integrative statistical analyses of multiple liquid biopsy analytes in metastatic breast cancer

2021 ◽  
Vol 13 (1) ◽  
Author(s):  
Corinna Keup ◽  
Vinay Suryaprakash ◽  
Siegfried Hauch ◽  
Markus Storbeck ◽  
Peter Hahn ◽  
...  
Keyword(s):  
Breast Cancer ◽  
Overall Survival ◽  
Metastatic Breast Cancer ◽  
Mutual Information ◽  
Hierarchical Clustering ◽  
Liquid Biopsy ◽  
Metastatic Breast ◽  
The Other ◽  
Theoretic Analysis ◽  
Graph Theoretic

Abstract Background Single liquid biopsy analytes (LBAs) have been utilized for therapy selection in metastatic breast cancer (MBC). We performed integrative statistical analyses to examine the clinical relevance of using multiple LBAs: matched circulating tumor cell (CTC) mRNA, CTC genomic DNA (gDNA), extracellular vesicle (EV) mRNA, and cell-free DNA (cfDNA). Methods Blood was drawn from 26 hormone receptor-positive, HER2-negative MBC patients. CTC mRNA and EV mRNA were analyzed using a multi-marker qPCR. Plasma from CTC-depleted blood was utilized for cfDNA isolation. gDNA from CTCs was isolated from mRNA-depleted CTC lysates. CTC gDNA and cfDNA were analyzed by targeted sequencing. Hierarchical clustering was performed within each analyte, and its results were combined into a score termed Evaluation of multiple Liquid biopsy analytes In Metastatic breast cancer patients All from one blood sample (ELIMA.score), which calculates the contribution of each analyte to the overall survival prediction. Singular value decomposition (SVD), mutual information calculation, k-means clustering, and graph-theoretic analysis were conducted to elucidate the dependence between individual analytes. Results A combination of two/three/four LBAs increased the prevalence of patients with actionable signals. Aggregating the results of hierarchical clustering of individual LBAs into the ELIMA.score resulted in a highly significant correlation with overall survival, thereby bolstering evidence for the additive value of using multiple LBAs. Computation of mutual information indicated that none of the LBAs is independent of the others, but the ability of a single LBA to describe the others is rather limited—only CTC gDNA could partially describe the other three LBAs. SVD revealed that the strongest singular vectors originate from all four LBAs, but a majority originated from CTC gDNA. After k-means clustering of patients based on parameters of all four LBAs, the graph-theoretic analysis revealed CTC ERBB2 variants only in patients belonging to one particular cluster. Conclusions The additional benefits of using all four LBAs were objectively demonstrated in this pilot study, which also indicated a relative dominance of CTC gDNA over the other LBAs. Consequently, a multi-parametric liquid biopsy approach deconvolutes the genomic and transcriptomic complexity and should be considered in clinical practice.

Development of Advanced CNC Interpolation Algorithm With Consideration of Command and Dynamic Errors

2015 ◽  
Author(s):  
Meng-Shiun Tsai ◽  
Ying-Che Huang
Keyword(s):  
The Other ◽  
Contour Error ◽  
Interpolation Algorithm ◽  
Interpolation Scheme ◽  
Error Equation ◽  
The Past ◽  
Cnc Interpolation ◽  
Dynamic Errors ◽  
Simulation Results ◽  
The Given

In this paper, an integrated acceleration/deceleration with dynamics interpolation scheme is proposed to confine the maximum contour error at the junction of linear junction. The dynamic contour error equation is derived analytically and then it is utilized for the interpolation design. Based on the derived formulations which could predict the command and dynamic errors, the advanced interpolation design could adjust the connecting velocity of the two blocks to confine the overall contour errors under the given tolerance. Simulation results validate the proposed algorithm can achieve higher accurate trajectory as compared to the other interpolation algorithm proposed in the past.

AKADEMSKI VOKABULAR: DA LI SU STUDENTI (U)OPŠTE OBRAZOVANI? O POTREBI ZA UKLjUČIVANjEM AKADEMSKOG VOKABULARA U KURIKULUME ZA SRPSKI JEZIK U SREDNjOJ ŠKOLI I NA UNIVERZITETU

Lipar ◽  
2020 ◽  
Vol XXI (73) ◽  
pp. 203-216
Author(s):  
Jovana Milovanović ◽  
Keyword(s):  
Academic Language ◽  
School Curriculum ◽  
The Other ◽  
Academic Vocabulary ◽  
High School Curriculum ◽  
Language Competence ◽  
Entrance Exams ◽  
University Level ◽  
Comparison Of The Results ◽  
The Given

This article discusses reception and production of academic vocabulary among native speakers of Serbian language. Academic vocabulary is one of the key elements of academic language competence, and a modest lexicon and underdeveloped academic language competence can cause problems in both comprehension and production. In this research, we used a vocabulary test consisting of 12 items taken from general culture entrance exams used at the Faculty of Philosophy, University of Belgrade. The participants are BA students of French language at the Faculty of Philology, University of Belgrade, years 1-4. The participants were instructed to provide a synonym or a definition for each item, as well as a sentence containing the given word. The aim of this research is to highlight issues in comprehension of academic vocabulary and establish the influence of factors such as word etymology or university level on the success of the participants. We analysed the results and classified them in three categories: correct, incorrect and unanswered. The majority of participants successfully identified just half of the given words (in order of success: poliglota 95,76%, bestseler 92,37%, pacifista 66,10%, suveren 58,47%, prototip 57,63%, elokventan 56,78%). The success level for the other half of the items from the test was below 50% (in order of success: erudita 49,15%, hipokrizija 39,83%, nepotizam 22,03%, skrupulozan 18,64%, šprahfeler 10,17%, eksproprijacija 8,47%). The influence of etymology was analysed through a comparison of the results for six items of French/Latin origin with the results for the other six items which did not originate from Romance languages. This analysis shows that the participants had similar results in both groups of items, with three words from each group having above 50% of correct answers (suveren, elokventan, pacifista; poliglota, bestseler, prototip). Lastly, we examined success levels from year 1, year 2, year 3 and year 4 students and determined that the median of correct answers for each year does vary, but that there is no strong linear progression (median year 1=5, year 2=6, year 3=7, year 4=6). The results indicate a lack of knowledge of academic vocabulary and difficulties in identifying and manipulating this type of lexis. We believe it is necessary to integrate academic language skills, including academic vocabulary, in high school curriculum and introduce Serbian language as a subject at university level.

A Model of Secure Functioning of Computer Systems

2021 ◽  
Vol 12 (3) ◽  
pp. 150-156
Author(s):  
A. V. Galatenko ◽  
◽  
V. A. Kuzovikhina ◽  
Keyword(s):  
Lower Bound ◽  
Computer System ◽  
Finite Automaton ◽  
Nonnegative Integer ◽  
The Other ◽  
Shannon Function ◽  
Security Breaches ◽  
System Functioning ◽  
The Cost ◽  
The Given

We propose an automata model of computer system security. A system is represented by a finite automaton with states partitioned into two subsets: "secure" and "insecure". System functioning is secure if the number of consecutive insecure states is not greater than some nonnegative integer k. This definition allows one to formally reflect responsiveness to security breaches. The number of all input sequences that preserve security for the given value of k is referred to as a k-secure language. We prove that if a language is k-secure for some natural and automaton V, then it is also k-secure for any 0 < k < k and some automaton V = V (k). Reduction of the value of k is performed at the cost of amplification of the number of states. On the other hand, for any non-negative integer k there exists a k-secure language that is not k"-secure for any natural k" > k. The problem of reconstruction of a k-secure language using a conditional experiment is split into two subcases. If the cardinality of an input alphabet is bound by some constant, then the order of Shannon function of experiment complexity is the same for al k; otherwise there emerges a lower bound of the order nk.

Sign in / Sign up

Export Citation Format

Share Document