Filters








243 Hits in 3.2 sec

Finding a Hamiltonian paths in tournaments on clusters - a provably communication-efficient approach

Chun-Hsi Huang, Xin He
<span title="">2001</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uo6yx5jpgnf2zl7mkrumytd4ti" style="color: black;">Proceedings of the 2001 ACM symposium on Applied computing - SAC &#39;01</a> </i> &nbsp;
Specifically, the first practical parallel algorithm, based on EREW BSP model, for finding Hamiltonian paths in tournaments is presented.  ...  The algorithm performance on Linux Cluster reaches 75% of the performance on SGI Origin 2000 when the tournament size is about one million.  ...  Sequential algorithm for finding Hamiltonian path is now applied in parallel, and the results, along with all the selected mediocre players form the final Hamiltonian path.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/372202.372459">doi:10.1145/372202.372459</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sac/HuangH01.html">dblp:conf/sac/HuangH01</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ifkcw7dllreqnk6svu6bdirp3a">fatcat:ifkcw7dllreqnk6svu6bdirp3a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20041023012706/http://www.cse.uconn.edu:80/~huang/personal/publication/SAC_01.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/d8/b8/d8b8e7c44f57201229e1137c1bbfb99f7be797ff.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/372202.372459"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Grid-enabled parallel divide-and-conquer

Chun-Hsi Huang
<span title="">2002</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uo6yx5jpgnf2zl7mkrumytd4ti" style="color: black;">Proceedings of the 2002 ACM symposium on Applied computing - SAC &#39;02</a> </i> &nbsp;
Specifically, a practical parallel algorithm with full scalability, based on the BSP model, for.finding Hamiltonian paths in tournaments is presented.  ...  These include a distributed-memory system: a Solaris cluster of 32 Sun Ultra5 computers on Myrinet network and a distributed shared-memory system: an SGI Origin 2000 with 32 R10000 processors, using MPICH-GM  ...  We focus on one such typical example, finding Hamiltonian paths in tournaments, a graph problem that has divide-and-conquer algorithm in sequential setting.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/508791.508959">doi:10.1145/508791.508959</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sac/Huang02.html">dblp:conf/sac/Huang02</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cpogpktzfbbwxnqfwcsa3di4y4">fatcat:cpogpktzfbbwxnqfwcsa3di4y4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20041210111457/http://ouray.cudenver.edu:80/~wfwheele/parallel/hw2/p865-huang.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/b4/0d/b40d6ae61ac2002f39dfcbf4b51286a10a7c64a4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/508791.508959"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Grid-enabled parallel divide-and-conquer

Chun-Hsi Huang
<span title="">2002</span> <i title="ACM Press"> Proceedings of the 2002 ACM symposium on Applied computing - SAC &#39;02 </i> &nbsp;
Specifically, a practical parallel algorithm with full scalability, based on the BSP model, for.finding Hamiltonian paths in tournaments is presented.  ...  These include a distributed-memory system: a Solaris cluster of 32 Sun Ultra5 computers on Myrinet network and a distributed shared-memory system: an SGI Origin 2000 with 32 R10000 processors, using MPICH-GM  ...  We focus on one such typical example, finding Hamiltonian paths in tournaments, a graph problem that has divide-and-conquer algorithm in sequential setting.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/508950.508959">doi:10.1145/508950.508959</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/joioumnpwngwxi6hpf53g5buum">fatcat:joioumnpwngwxi6hpf53g5buum</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20041210111457/http://ouray.cudenver.edu:80/~wfwheele/parallel/hw2/p865-huang.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/b4/0d/b40d6ae61ac2002f39dfcbf4b51286a10a7c64a4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/508950.508959"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A survey on Hamilton cycles in directed graphs [article]

Daniela Kühn, Deryk Osthus
<span title="2010-06-03">2010</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We survey some recent results on long-standing conjectures regarding Hamilton cycles in directed graphs, oriented graphs and tournaments.  ...  We also combine some of these to prove the following approximate result towards Kelly's conjecture on Hamilton decompositions of regular tournaments: the edges of every regular tournament can be covered  ...  Acknowledgements We are grateful to Demetres Christofides, Peter Keevash and Andrew Treglown for their comments on a draft of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1006.0590v1">arXiv:1006.0590v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vayfrvmx2vba7fnbrhoriu2dxq">fatcat:vayfrvmx2vba7fnbrhoriu2dxq</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1006.0590/1006.0590.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> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/18/a2/18a247c7f8358388418db5e9b9d42dc78abdd9aa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1006.0590v1" 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>

A survey on Hamilton cycles in directed graphs

Daniela Kühn, Deryk Osthus
<span title="">2012</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/54t3hgai4fhhthc74mj7z7tapu" style="color: black;">European journal of combinatorics (Print)</a> </i> &nbsp;
We survey some recent results on long-standing conjectures regarding Hamilton cycles in directed graphs, oriented graphs and tournaments.  ...  We also combine some of these to prove the following approximate result towards Kelly's conjecture on Hamilton decompositions of regular tournaments: the edges of every regular tournament can be covered  ...  Acknowledgements We are grateful to Demetres Christofides, Peter Keevash and Andrew Treglown for their comments on a draft of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ejc.2011.09.030">doi:10.1016/j.ejc.2011.09.030</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rmtwpq6ybffpdpokb2wcssl4l4">fatcat:rmtwpq6ybffpdpokb2wcssl4l4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171004031715/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/d79/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDE5NTY2OTgxMTAwMTc4OA%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/3a/a6/3aa69865b9e6a66326ffdc6dbbd1932b4d07bc51.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ejc.2011.09.030"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Hardness of subgraph and supergraph problems in c-tournaments

S. Kanthi Kiran, N.S. Narayanaswamy
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
We study the complexity of feedback vertex set and r-dominating set in c-tournaments. We also present hardness results on some graph editing problems involving c-tournaments.  ...  This motivates us to study a natural generalization of tournaments, named c-tournaments, and see if the structural properties of these graphs are helpful in obtaining similar algorithms. c-tournaments  ...  While it is known that tournaments always have a Hamiltonian path (in fact more), 2-tournaments need not have one (it is easy to construct a counter example).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2011.04.046">doi:10.1016/j.tcs.2011.04.046</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uemifdy4jzfx5fypufnt4z4erm">fatcat:uemifdy4jzfx5fypufnt4z4erm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170925084637/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/259/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUxMTAwMzU1MA%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/98/e9/98e9e10361c06ffa97e6e2cbfd4eb37758a5be90.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2011.04.046"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A polyhedral study of the asymmetric traveling salesman problem with time windows

Norbert Ascheuer, Matteo Fischetti, Martin Gr�tschel
<span title="">2000</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p4qgtym3grdnngfxilwqjjxqy4" style="color: black;">Networks</a> </i> &nbsp;
Computational experiments on the new formulation are reported in a companion paper, where we show that it outperforms alternative formulations on some classes of problem instances.  ...  In the formulation, time-window restrictions are modeled using "infeasible path elimination" constraints. We present the basic form of these constraints along with some possible strengthenings.  ...  Acknowledgments We are grateful for the suggestions Andreas Schulz made on this topic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/1097-0037(200009)36:2&lt;69::aid-net1&gt;3.0.co;2-q">doi:10.1002/1097-0037(200009)36:2&lt;69::aid-net1&gt;3.0.co;2-q</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/snldsuglmbhexijff3uxho3oy4">fatcat:snldsuglmbhexijff3uxho3oy4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20031128231443/http://www.zib.de:80/groetschel/pubnew/paper/ascheuerfischettigroetschel2000.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/22/10/2210d68d6712d49a259b9ba3ff3671985502842b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/1097-0037(200009)36:2&lt;69::aid-net1&gt;3.0.co;2-q"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Page 2093 of Mathematical Reviews Vol. , Issue 2002C [page]

<span title="">2002</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
of a Hamiltonian path in a tournament.  ...  2093 2002c:68022 68P10 0SC85 68P05 68R10 68W10 Wu, Jie [Wu, Jie*] (1-FLAT-CS; Boca Raton, FL) On finding a Hamiltonian path in a tournament using semi-heap. (English summary) Parallel Process.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2002-03_2002c/page/2093" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2002-03_2002c/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A fast parallel algorithm for finding Hamiltonian cycles in dense graphs

Gábor N. Sárközy
<span title="">2009</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
This is a significant improvement on the previous best NC-algorithm for the problem, which finds a Hamiltonian cycle only in Dirac graphs (δ(G) ≥ n/2 where δ(G) is the minimum degree in G).  ...  An NC 4 -algorithm is presented which accepts as input an η-Chvátal graph and produces a Hamiltonian cycle in G as an output.  ...  Research was supported in part by the National Science Foundation under Grant No. DMS-0456401.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.disc.2008.02.041">doi:10.1016/j.disc.2008.02.041</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/waa64z6bgvep3jhou7iosy3lou">fatcat:waa64z6bgvep3jhou7iosy3lou</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190315161650/https://core.ac.uk/download/pdf/82448773.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/50/57/5057d5f6143166824a9ed17984f5ad9879ce63a5.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.2008.02.041"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

An updated survey on the linear ordering problem for weighted or unweighted tournaments

Irène Charon, Olivier Hudry
<span title="2009-11-19">2009</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kov3rwzipzf2dmxyohqwfpxrsm" style="color: black;">Annals of Operations Research</a> </i> &nbsp;
This problem consists in finding a linear order which is at minimum distance from a (weighted or not) tournament.  ...  We show how it can be used to model an aggregation problem consisting of going from individual preferences defined on a set of candidates to a collective ranking of these candidates.  ...  We know bounds of the maximum number H (n) of Hamiltonian paths that a tournament on n vertices can own.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10479-009-0648-7">doi:10.1007/s10479-009-0648-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qb334dx6wzazrdohm5ktexlcde">fatcat:qb334dx6wzazrdohm5ktexlcde</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190304081034/http://pdfs.semanticscholar.org/d85c/5f763579632cf264aed6c36748031bbb892b.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/d8/5c/d85c5f763579632cf264aed6c36748031bbb892b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10479-009-0648-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A memetic-aided approach to hierarchical clustering from distance matrices: application to gene expression clustering and phylogeny

Carlos Cotta, Pablo Moscato
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dbxvzia7tzcdzoff4xmqtr4qrq" style="color: black;">Biosystems (Amsterdam. Print)</a> </i> &nbsp;
By using MAs to solve some variants of the Minimum Weight Hamiltonian Path Problem on the input matrix, a sequence of the individual elements to be clustered (referred to as patterns) is first obtained  ...  We propose a heuristic approach to hierarchical clustering from distance matrices based on the use of memetic algorithms (MAs).  ...  Badger for making available to us the 84animals instance, and for answering several questions on their research. P. Moscato would like to thank here, although with some delay, M. Nei and N.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0303-2647(03)00136-9">doi:10.1016/s0303-2647(03)00136-9</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/14642660">pmid:14642660</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/flflf3nepbd2pfrqzjc2b3ymwm">fatcat:flflf3nepbd2pfrqzjc2b3ymwm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808131401/http://www.biblioteca.uma.es/bbldoc/articulos/16641164.pdf?origin=publication_detail" 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/ac/6b/ac6b7127c3013c0bf5f8f0e5e6080fc09a3d9033.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0303-2647(03)00136-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Hamiltonian degree sequences in digraphs [article]

Daniela Kühn, Deryk Osthus, Andrew Treglown
<span title="2009-12-01">2009</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In fact, we prove the stronger result that such digraphs G are pancyclic.  ...  We show that for each η>0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d^+_1< ... < d^+_n and d^- _1 < ... < d^-_n satisfy (i) d^+_i ≥ i+ η n or d^-_n-i  ...  However, if C is a cycle containing x then the inneighbour of x on C must lie in K. But the shortest path from x to K has length k − 1 and so |C| ≥ k, as required.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0807.1827v2">arXiv:0807.1827v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jhnruwp66zgq3of3saswykajvy">fatcat:jhnruwp66zgq3of3saswykajvy</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0807.1827/0807.1827.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> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0807.1827v2" 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>

Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number

Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi, Michael Wagner
<span title="2018-11-23">2018</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yjwtenvm3vc4tjdmag7doffpby" style="color: black;">Foundations of Software Technology and Theoretical Computer Science</a> </i> &nbsp;
In this paper, we further strengthen this belief by showing that several cut problems that admit sub-exponential time parameterized algorithms (a trait uncommon to parameterized algorithms) on tournaments  ...  by a sub-exponential FPT function (Fomin and Pilipczuk bounded the number of k-cuts in transitive tournaments).  ...  A directed Hamiltonian path in D is a directed simple path on all vertices in D.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.fsttcs.2018.35">doi:10.4230/lipics.fsttcs.2018.35</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/fsttcs/Misra0SZ18.html">dblp:conf/fsttcs/Misra0SZ18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ppgyvgyoezbohcntekwywlevua">fatcat:ppgyvgyoezbohcntekwywlevua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200213022040/https://drops.dagstuhl.de/opus/volltexte/2018/9934/pdf/LIPIcs-FSTTCS-2018-35.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/16/6f/166fbcd010a0445dec3dea8c3ff2341abd1f8884.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.fsttcs.2018.35"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Hamiltonian degree sequences in digraphs

Daniela Kühn, Deryk Osthus, Andrew Treglown
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/g6u5fful5vcr3a7gppc6y47el4" style="color: black;">Journal of combinatorial theory. Series B (Print)</a> </i> &nbsp;
In fact, we prove the stronger result that such digraphs G are pancyclic.  ...  We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out-and indegree sequences d + This gives an approximate solution to a problem of Nash- Williams (1975) [  ...  It is easy to see that G is neither Hamiltonian, nor strongly connected, but satisfies the condition on the degree sequences given in Conjecture 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jctb.2009.11.004">doi:10.1016/j.jctb.2009.11.004</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pag54l7krbcydnvyl4avvbihva">fatcat:pag54l7krbcydnvyl4avvbihva</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190320044330/https://core.ac.uk/download/pdf/82599297.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/60/97/60977f53f7578f7ef8dc7fd5443dcad5bcd3fcc1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jctb.2009.11.004"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Triangle packings and 1-factors in oriented graphs [article]

Peter Keevash, Benny Sudakov
<span title="2008-06-12">2008</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In addition, under quite general conditions on the n_i we can remove the O(1) additive error and find a prescribed 1-factor.  ...  In this paper we show that any oriented graph G on n vertices with minimum indegree and outdegree at least (1/2-o(1))n contains a packing of cyclic triangles covering all but at most 3 vertices.  ...  With the directions each of these cliques becomes a tournament (i.e. a complete oriented graph) and it is well known that any tournament has a Hamiltonian path (i.e. a path containing all of its vertices  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0806.2027v1">arXiv:0806.2027v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ogvzeuyasreehbh7tiopgoicey">fatcat:ogvzeuyasreehbh7tiopgoicey</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0806.2027/0806.2027.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> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0806.2027v1" 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>
&laquo; Previous Showing results 1 &mdash; 15 out of 243 results