Filters








1,731,506 Hits in 5.0 sec

A note on minimal matching covered graphs

V.V. Mkrtchyan
<span title="">2006</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
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.  ...  Note that F 0 ∈ M(G) and e (F 0 ) < e (F 0 ), which is impossible, therefore w 0 ∈ A(F 0 ).  ...  In the "bible" of matching theory [4] one can find a detailed analysis of the structure of 1-extendable graphs (connected matching covered graphs containing a perfect matching) and all necessary references  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.disc.2005.12.006">doi:10.1016/j.disc.2005.12.006</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kwqejttwdvdh3pqc3xsnl5qq4m">fatcat:kwqejttwdvdh3pqc3xsnl5qq4m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170924203423/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/1ba/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAxMjM2NXgwNTAwNjExNA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/25/d2/25d2532b0b7ac5c8963e537e67ccfb4ae0c40f97.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.disc.2005.12.006"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A Note on Minimal Covers for Sofic Systems

Mike Boyle, Bruce Kitchens, Brian Marcus
<span title="">1985</span> <i title="JSTOR"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/a64sw4kcsveajhudnssdwrwvze" style="color: black;">Proceedings of the American Mathematical Society</a> </i> &nbsp;
We characterize the sofic systems which have minimal subshift-of-fimtetype covers and derive some consequences.  ...  We now give a simple example of a sofic system which has no minimal SFT cover-equivalently (by Corollary 13), is not AFT.  ...  Actually, this example was the motivation for this paper; several years ago, one of the authors (B. Kitchens) gave a direct proof that the sofic system S above has no minimal SFT cover.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2307/2045810">doi:10.2307/2045810</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/74gbkqgudfhsbfstunyx3fj37e">fatcat:74gbkqgudfhsbfstunyx3fj37e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725055637/http://www.ams.org/journals/proc/1985-095-03/S0002-9939-1985-0806078-7/S0002-9939-1985-0806078-7.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/39/3d/393d4ed62df589ea195a80fd9d5ded7a7202bf0f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2307/2045810"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> jstor.org </button> </a>

A note on the size of minimal covers

Vaston Costa, Edward Haeusler, Eduardo S. Laber, Loana Nogueira
<span title="">2007</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5xfy4fcdxvcvdiybp6iqbffqc4" style="color: black;">Information Processing Letters</a> </i> &nbsp;
This result can be translated to graph language as follows: for every graph G = (V , E) the inequality |V | (λ + 2) 2 /4 holds, where λ is the size of the largest minimal vertex cover of G.  ...  We have that S 1 is a cover of G (not necessarily minimal). Let T ⊆ S 1 be a minimal cover for G. We have N C (x) ⊆ T , for otherwise one of the edges that touches x would not be covered by T .  ...  Note that S x ⊆ C − x, which satisfies condition (1). Since C is a largest minimal cover of G, we also have that |T | |C|.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2006.10.012">doi:10.1016/j.ipl.2006.10.012</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y7zyovp2vjbzxnjb6qaqeoxige">fatcat:y7zyovp2vjbzxnjb6qaqeoxige</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090625191314/http://www-di.inf.puc-rio.br/~laber/public/ipl-cover.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2a/63/2a6398d93e87e795c1c8fcec8dbaf5e09bf84cef.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2006.10.012"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A note on minimal covers for sofic systems

Mike Boyle, Bruce Kitchens, Brian Marcus
<span title="1985-03-01">1985</span> <i title="American Mathematical Society (AMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/a64sw4kcsveajhudnssdwrwvze" style="color: black;">Proceedings of the American Mathematical Society</a> </i> &nbsp;
We characterize the sofic systems which have minimal subshift-of-fimtetype covers and derive some consequences.  ...  We now give a simple example of a sofic system which has no minimal SFT cover-equivalently (by Corollary 13), is not AFT.  ...  Actually, this example was the motivation for this paper; several years ago, one of the authors (B. Kitchens) gave a direct proof that the sofic system S above has no minimal SFT cover.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/s0002-9939-1985-0806078-7">doi:10.1090/s0002-9939-1985-0806078-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/65f3nr5bxfdijhx3kqaudvzwya">fatcat:65f3nr5bxfdijhx3kqaudvzwya</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170823022134/http://www.ams.org/journals/proc/1985-095-03/S0002-9939-1985-0806078-7/S0002-9939-1985-0806078-7.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/58/6e/586e417fa50e12375e46c314c331b4ca0a4df834.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/s0002-9939-1985-0806078-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A note on minimal coverings of groups by subgroups

R. A. Bryce, L. Serena
<span title="">2001</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qucxg3yndjaptj6krclryhveua" style="color: black;">Journal of the Australian Mathematical Society</a> </i> &nbsp;
A cover for a group is a finite set of subgroups whose union is the whole group. A cover is minimal if its cardinality is minimal.  ...  Minimal covers of finite soluble groups are categorised; in particular all but at most one of their members are maximal subgroups.  ...  A minimal cover is one of least cardinality among covers for the group; it is necessarily irredundant. The size of a minimal cover of a group G we denote o{G).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1446788700002809">doi:10.1017/s1446788700002809</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n7tbismggbdl7dj2klmnwpeaku">fatcat:n7tbismggbdl7dj2klmnwpeaku</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180728225454/https://www.cambridge.org/core/services/aop-cambridge-core/content/view/7DB0C840455D2BA765CA5292F6F3BD8E/S1446788700002809a.pdf/div-class-title-a-note-on-minimal-coverings-of-groups-by-subgroups-div.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ed/aa/edaa8f25b794d1b6879a8421e94a1610ded7c9de.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1446788700002809"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> cambridge.org </button> </a>

A note on the two symmetry-preserving covering maps of the gyroid minimal surface

V. Robins, S. J. Ramsden, S. T. Hyde
<span title="">2005</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mtjzh5k74rffbo7d6gwo5kig2e" style="color: black;">European Physical Journal B : Condensed Matter Physics</a> </i> &nbsp;
Our study of the gyroid minimal surface has revealed that there are two distinct covering maps from the hyperbolic plane onto the surface that respect its intrinsic symmetries.  ...  We show that if a decoration of H 2 is chiral, the projection of this pattern via the two covering maps gives rise to distinct structures in E 3 .  ...  that if a pattern in H 2 is "the same" as its mirror image, then it projects to "the same" pattern on the G surface via the two covering maps.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1140/epjb/e2005-00377-x">doi:10.1140/epjb/e2005-00377-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m4cjbqz5kncxhgydzwkqrfn4i4">fatcat:m4cjbqz5kncxhgydzwkqrfn4i4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110225200928/http://people.physics.anu.edu.au/~sth110/2_Gyroid_embeds_EPJ_B.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d1/f0/d1f0c52ee5bd164fdf78dbae988fb398efb90a46.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1140/epjb/e2005-00377-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

The Covering Method for Exponential Sums and Some Applications

Ivelisse Rubio
<span title="2020-05-01">2020</span> <i title="American Mathematical Society (AMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o5hwtvfzwza2tdpaa2xm3sqpqe" style="color: black;">Notices of the American Mathematical Society</a> </i> &nbsp;
Moreno-Moreno used minimal coverings of a Boolean function to obtain a bound on the 2-divisibility of the exponential sum of . Theorem 1 ([14]). Let be a minimal covering of ∈ 2 [ ].  ...  ( − 1)coverings of size of a polynomial = and suppose that any minimal partial ( − 1)-covering is one of the 's.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/noti2073">doi:10.1090/noti2073</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7yx3eviy4bam5itfhxnifmy2ty">fatcat:7yx3eviy4bam5itfhxnifmy2ty</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200415023847/http://www.ams.org/notices/202005/rnoti-p616.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fa/23/fa23f8c927f9af4edf9f8fda1d9f2d30cd62df78.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/noti2073"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A note on line coverings of graphs

Mordechai Lewin
<span title="">1973</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
It is shown ,that a minimal cover of a graph is minimum if and only if it contains a maximum matching of that graph; a maximal matcmg of a graph is maximum if and only ifit is contained in a minimum cover  ...  Let minimum, maximum, refer to the number of elements in a set and let minimal, rnuximul refer to set inclusion.  ...  Since A is minimal, it follows that at least one line of A-B t;overs two points of G which are not covered by B. This is a co&ad i&ion since B is a maximum matching.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0012-365x(73)90144-1">doi:10.1016/0012-365x(73)90144-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wctzjjjkybdpdk7l4zjdmfw4fu">fatcat:wctzjjjkybdpdk7l4zjdmfw4fu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190307221943/https://core.ac.uk/download/pdf/82163497.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/30/1f/301fb526bb73b82acef738d1c1f2e15302390add.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0012-365x(73)90144-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A Fibonacci-like Sequence of Composite Numbers

John W. Nicol
<span title="1999-11-06">1999</span> <i title="The Electronic Journal of Combinatorics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/v5dyak6ulffqfara7hmuchh24a" style="color: black;">Electronic Journal of Combinatorics</a> </i> &nbsp;
Here we improve Graham's construction and generalize Wilf's note, and show that the 12-digit pair $$(a,b)= (407389224418,76343678551)$$ also defines such a sequence.  ...  In 1990, Donald Knuth found a 17-digit pair satisfying the same conditions. That same year, noting an improvement to Knuth's computation, Herbert Wilf found a yet smaller 17-digit pair.  ...  Wilf, armed with the observation that if a < b, then the pair (b − a, a) forms a smaller sequence, took one of the "non-minimal" pairs found by Knuth and projected it backwards.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.37236/1476">doi:10.37236/1476</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/whi7o67x65eypg32duupnhgbvi">fatcat:whi7o67x65eypg32duupnhgbvi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200114033255/https://www.combinatorics.org/ojs/index.php/eljc/article/download/v6i1r44/pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/de/2c/de2cc67bf858583f0792c4735cd245de0b8f83e6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.37236/1476"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Tolerances induced by irredundant coverings [article]

Jouni Järvinen, Sándor Radeleczki
<span title="2014-10-27">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we consider tolerances induced by irredundant coverings. Each tolerance R on U determines a quasiorder ≲_R by setting x ≲_R y if and only if R(x) ⊆ R(y).  ...  We prove that for a tolerance R induced by a covering H of U, the covering H is irredundant if and only if the quasiordered set (U, ≲_R) is bounded by minimal elements and the tolerance R coincides with  ...  Acknowledgements We thank the anonymous referees for their valuable remarks on our manuscript.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1404.5184v2">arXiv:1404.5184v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cydsv25alvbtpmnct4lhdatidq">fatcat:cydsv25alvbtpmnct4lhdatidq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200907074441/https://arxiv.org/pdf/1404.5184v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/37/de/37def9a95938517da6a9f0c1a7971aec9f9fcfbc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1404.5184v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach [chapter]

Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We show that the number of minimal dominating sets in a graph on n vertices is at most 1.7697 n , thus improving on the trivial O(2 n / √ n) bound.  ...  Based on this result, we derive an O(2.8805 n ) algorithm for the domatic number problem, and an O(1.5780 n ) algorithm for the minimum-weight dominating set problem.  ...  A covering is minimal if it contains no smaller covering. We denote by COV(U, S) the number of minimal coverings in (U, S).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11602613_58">doi:10.1007/11602613_58</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hjeg4xv3zzb6pgmtgvy5qn6d3i">fatcat:hjeg4xv3zzb6pgmtgvy5qn6d3i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150912202853/http://people.idsia.ch/~grandoni/Pubblicazioni/FGPS05isaac.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a7/7c/a77cea0b565e8c90a2d2203a1a33819ed6adfec4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11602613_58"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A note on bounds for the cop number using tree decompositions [article]

Anthony Bonato, N.E. Clarke, S. Finbow, S. Fitzpatrick, M.E. Messinger
<span title="2013-08-13">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this short note, we supply a new upper bound on the cop number in terms of tree decompositions. Our results in some cases extend a previously derived bound on the cop number using treewidth.  ...  The cops X can move to a minimal retract cover of B ′ and C ′ ensures that R never enters B (note that B ∩ B ′ is a cut-set of G).  ...  A retract cover which achieves this minimum is called a minimal retract cover of H.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1308.2839v1">arXiv:1308.2839v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ijqewc43sfd5pftpfiy3oukeki">fatcat:ijqewc43sfd5pftpfiy3oukeki</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191020185833/https://arxiv.org/pdf/1308.2839v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1c/68/1c6821e16afdbf4cd6dca91e16759d962d679672.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1308.2839v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Set Covering Problems in Role-Based Access Control [chapter]

Liang Chen, Jason Crampton
<span title="">2009</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Most significantly, we introduce the minimal cover problem -a generalization of the set cover problem -which we use to determine the complexity of the inter-domain role mapping problem.  ...  A number of interesting problems related to the well known set cover problem have come to light as a result of this activity.  ...  The final version has been much improved as a result of the referees' insightful feedback.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-04444-1_42">doi:10.1007/978-3-642-04444-1_42</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i6g5a7jpkfhodl2ex4utn6xo7e">fatcat:i6g5a7jpkfhodl2ex4utn6xo7e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810070731/http://www.isg.rhul.ac.uk/~pqah018/pubs/esorics09.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/61/c9/61c9ecc081481c7648bcae96f51d04049a3194d8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-04444-1_42"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

The complexity of finding minimal Voronoi covers with applications to machine learning

David Heath, Simon Kasif
<span title="">1993</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/is2k7576zbherpepqy3y7zkzuy" style="color: black;">Computational geometry</a> </i> &nbsp;
We consider the question "Given a planar polygonal tessellation T and an integer k, ifications. Given a new example for which the classification is unknown, the Correspondence to:  ...  Our goal in this paper is to examine the application of Voronoi diagrams, a fundamental concept of computational geometry, to the nearest neighbor algorithm used in machine learning.  ...  Note that in a minimal (constrained) Voronoi cover, that the other two gadgets will also contain horizontally centered points.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0925-7721(93)90019-3">doi:10.1016/0925-7721(93)90019-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tqnbj7ajn5e3bmmav5xyc355ti">fatcat:tqnbj7ajn5e3bmmav5xyc355ti</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070119234710/http://www.stat.ucla.edu:80/~chrisbarr/research/library/heath.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fb/f9/fbf971eb774292d7a4e41d55f7159d031d247c79.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0925-7721(93)90019-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Minimal polynomials for the conjunction of functions on disjoint variables can be very simple

Bernd Voigt, Ingo Wegener
<span title="">1989</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
ACKNOWLEDGMENTS We thank Hans Ulrich Simon who asked the second author (in different terminology) whether the DCSH( A ) holds for minimal polynomials.  ...  Note that each prime implicant of fi,, covers only a single input with VOIGT AND WEGENER exactly k ones and a single input with exactly 1 ones.  ...  Note that this covers the cases ln/2J <k d I (resp. k < Ln/2_1< I and k k n -I). Let a be an input with exactly k ones.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0890-5401(89)90047-3">doi:10.1016/0890-5401(89)90047-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/erlme6eldfcvni3rwmro3zbgs4">fatcat:erlme6eldfcvni3rwmro3zbgs4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190326030621/https://core.ac.uk/download/pdf/82411021.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7a/6f/7a6f2eb0437029a85e613b16dd8490599a2d819b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0890-5401(89)90047-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,731,506 results