Filters








3,879 Hits in 2.5 sec

Tandem-win graphs

Nancy E. Clarke, Richard J. Nowakowski
2005 Discrete Mathematics  
We present a recognition theorem for tandem-win graphs, and a characterization of triangle-free tandem-win graphs.  ...  In this version of the Cops and Robber game, the cops move in tandems, or pairs, such that they are at distance at most one after every move.  ...  A graph on which two cops playing in tandem in this way can win is said to be tandem-win.  ... 
doi:10.1016/j.disc.2004.11.016 fatcat:kjucjvajsfhqvfz7wrpj2iwe4e

A Tandem version of the Cops and Robber Game played on products of graphs

Nancy E. Clarke, Richard J. Nowakowski
2005 Discussiones Mathematicae Graph Theory  
The problem is to determine, for a given graph G, the minimum number of tandems sufficient to guarantee a win for the cops.  ...  We investigate this game on three graph products, the Cartesian, categorical and strong products.  ...  The strong product of a copwin graph G and a tandem-win graph H is tandem-win. P roof. Let G be a copwin graph and let H be a tandem-win graph.  ... 
doi:10.7151/dmgt.1277 fatcat:nnhlztdwmrfsfnbmckjxkuyo3e

A witness version of the Cops and Robber game

Nancy E. Clarke
2009 Discrete Mathematics  
In the case when sightings occur at regular intervals, we present a recognition theorem for graphs on which a single cop suffices to guarantee a win.  ...  A similar decomposition algorithm exists for recognizing tandem-win graphs (a class of graphs on which two cops suffice to win) although, unlike with copwin graphs, it is not a characterization.  ...  This concept of decomposition tree is analogous to that of copwin spanning tree introduced in [8] and tandem-win decomposition tree introduced in [5] .  ... 
doi:10.1016/j.disc.2008.09.032 fatcat:ejvwduuto5er5kmki6eyo4kkgq

Author index to volume 299

2005 Discrete Mathematics  
Walker, The graphs with maximum induced matching and maximum matching the same size (1-3) 49-55 Clarke, N.E. and R.J. Nowakowski, Tandem-win graphs (1-3) 56-64 Dobson, E. and J.  ...  Balbuena, Improved lower bound for the vertex connectivity of ð; D., Quartic half-arc-transitive graphs with large vertex stabilizers (1-3) 180-193 Maureso, M. and J.M.  ... 
doi:10.1016/s0012-365x(05)00408-5 fatcat:opa3uuyl7jhbhgyh7f3icvysli

Characterizations of k-copwin graphs

Nancy E. Clarke, Gary MacGillivray
2012 Discrete Mathematics  
We give two characterizations of the graphs on which k cops have a winning strategy in the game of Cops and Robber.  ...  As a step towards achieving a characterization of 2-copwin graphs, Clarke and Nowakowski [10, 11] (see also [7] ) defined tandem-win graphs.  ...  These extensions are discussed in Section Four where we make particular note of the elimination order characterization of tandem-win finite reflexive graphs [11] .  ... 
doi:10.1016/j.disc.2012.01.002 fatcat:be2pclj3xzeznctd5k7hq5cbky

Contents

2005 Discrete Mathematics  
Jung Some degree bounds for the circumference of graphs 311 R. Xu and C.-Q. Zhang On flows in bidirected graphs 335 N.E. Clarke and R.J. Nowakowski Tandem-win graphs 56 E.  ...  Walker The graphs with maximum induced matching and maximum matching the same size 49 E. Salehi, S.-M. Lee and M. Khatirinejad IC-Colorings and IC-Indices of graphs 297 E. Vumar and H.A.  ... 
doi:10.1016/s0012-365x(05)00407-3 fatcat:rxvtxpybhzgy3krwwreznodnvy

Elimination schemes and lattices

M.E. Messinger, R.J. Nowakowski, P. Prałat
2014 Discrete Mathematics  
Partial elimination schemes reduce a graph to an important subgraph, for example, k-cores and robber-win graphs.  ...  Perfect vertex elimination schemes are part of the characterizations for several classes of graphs, including chordal and cop-win.  ...  In Section 3.1 we consider the reduction to robber-win graphs in the usual cops-androbber game as well as in the tandem-win version.  ... 
doi:10.1016/j.disc.2014.03.024 fatcat:m7f5lf64p5advk3x72s7zmlgue

Tandem Economic Development Of Two Regions Or Countries

Ileana Ciutacu, Iulian Săvulescu, Luminiţa Mihaela Dumitraşcu
2014 Balkan Region Conference on Engineering and Business Education  
The objective of this research is to see the way in which the economies of two regions develop in tandem over time and why.  ...  and not only them, lead to a win-win situation.  ...  created by humankind is the expression of the wisdom based on love, authentic knowledge and faith to underline through and for the benefit of people the potential energies of this world following the win-win  ... 
doi:10.2478/cplbu-2014-0102 fatcat:lv2lomkz3vgwhbmrnspp46ptge

Evolution of Tandemly Repeated Sequences Through Duplication and Inversion [chapter]

Denis Bertrand, Mathieu Lajoie, Nadia El-Mabrouk, Olivier Gascuel
2006 Lecture Notes in Computer Science  
Thus, choosing the phylogeny with the lowest number of inversions is either a winning strategy (roughly 50% of the time) or useless, but is almost never misleading.  ...  A tandem duplication history (or just duplication history for brevity) is the sequence of tandem duplications that have generated O.  ... 
doi:10.1007/11864127_11 fatcat:24mh5avkk5fv5j4dpfkjcrbww4

Characterizations and algorithms for generalized Cops and Robbers games [article]

Anthony Bonato, Gary MacGillivray
2017 arXiv   pre-print
has a winning strategy.  ...  If the Pursuer can ensure that the game enters into a fixed set of final positions, then the Pursuer wins; otherwise, the Evader wins.  ...  This result generalizes the relational characterization of cop-win graphs from [23] , and the one given for k-cop-win graphs in [13, 20] .  ... 
arXiv:1704.05655v1 fatcat:f5hibpcmjvachbe2yn7d7zw4bu

Tipping the balances of a small world [article]

Luis M. A. Bettencourt
2003 arXiv   pre-print
These are random graphs with clustering: N individuals are represented as nodes, each with an average number of connections z.  ...  Moreover the addition of a second wellconnected node dealing with the same information reduces the predictability of emerging trends, unless the two hubs work in tandem (as would happen under specific  ... 
arXiv:cond-mat/0304321v1 fatcat:pq5ujnsplrg7rgvn5vuvzffsqa

Detecting intermittent switching leadership in coupled dynamical systems

Violet Mwaffo, Jishnu Keshavan, Tyson L. Hedrick, Sean Humbert
2018 Scientific Reports  
We demonstrate the effectiveness of our approach to dissect potential changes in leadership on self-propelled particles where the emergence of leader-follower relationship can be controlled and on tandem  ...  The network graph representation of such complex structure is essential to understand and anticipate the mechanisms underlying the emergence of collective behaviour 7,8 as well as their resilience to noise  ...  A predictive performance comparison shows that the window size (win = 0.25 s) provides the best leadership switching detection in tandem bird flight.  ... 
doi:10.1038/s41598-018-28285-1 pmid:29985402 pmcid:PMC6037816 fatcat:yu3b6qxme5eifcboj5v6b5miim

SGIP1 alters internalization and modulates signaling of activated cannabinoid receptor 1 in a biased manner

Alena Hájková, Šárka Techlovská, Michaela Dvořáková, Jayne Nicole Chambers, Jiří Kumpošt, Pavla Hubálková, Laurent Prezeau, Jaroslav Blahos
2016 Neuropharmacology  
B) ERK1/2 activation using synthetic ligand WIN without (left), or after PTX pretreatment (right) C) Dose response curves of ERK 1/2 phosphorylation mediated via WIN stimulated CB1R alone or in tandem  ...  E) Graph showing the fluorescence internalization ratio (FIR), calculated as the ratio between the internalized and cell surface CB1R. Each value represents mean ± SEM (n ¼ 8).  ... 
doi:10.1016/j.neuropharm.2016.03.008 pmid:26970018 fatcat:amftjibq6ne7vn5iiq7aozgc5y

Bayesian networks for mass spectrometric metabolite identification via molecular fingerprints

Marcus Ludwig, Kai Dührkop, Sebastian Böcker
2018 Bioinformatics  
Recently, we presented CSI:FingerID for searching in molecular structure databases using tandem mass spectrometry data.  ...  Untargeted metabolomics experiments usually rely on tandem mass spectrometry to identify the thousands of compounds in a biological sample.  ...  Platt Cross validation, Welch's t-test (ten folds) 6:4 Â 10 À5 8:0 Â 10 À4 Cross validation, sign test on wins (N ¼ 16 865) 1:5 Â 10 À60 3:1 Â 10 À21 Agilent, sign test on wins (N ¼ 3 451  ... 
doi:10.1093/bioinformatics/bty245 pmid:29949965 pmcid:PMC6022630 fatcat:df3rm5gaafgjfbype53vavscxy

DIAmeter: matching peptides to data-independent acquisition mass spectrometry data

Yang Young Lu, Jeff Bilmes, Ricard A Rodriguez-Mias, Judit Villén, William Stafford Noble
2021 Bioinformatics  
Motivation Tandem mass spectrometry data acquired using data independent acquisition (DIA) is challenging to interpret because the data exhibits complex structure along both the mass-to-charge (m/z) and  ...  Orbitrap fixed-win (10m/z) Orbitrap fixed-win (5m/z) Plasma / TripTOF 5600 / fixed-win (25 m/z) OxMetYeast / Orbitrap / fixed-win (20 m/z) OxMetYeast / Orbitrap / fixed-win (10 m/z) LFQbench  ...  (20m/z) Detected peptides (1% peptide-level FDR) TripTOF 5600 fixed-win (25m/z) TripTOF 5600 fixed-win (25m/z) TripTOF 6600 fixed-win (25m/z) TripTOF 5600 variable-win TripTOF 6600 variable-win  ... 
doi:10.1093/bioinformatics/btab284 pmid:34252924 pmcid:PMC8686675 fatcat:uuubd7m7gfcofomsxowwnhs2ea
« Previous Showing results 1 — 15 out of 3,879 results