Filters








89,514 Hits in 5.0 sec

Parallel Algorithms for Geometric Graph Problems [article]

Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev
<span title="2014-01-04">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We give algorithms for geometric graph problems in the modern parallel models inspired by MapReduce.  ...  As such, it is tempting to conjecture that the parallel models may also constitute a concrete playground in the quest for efficient algorithms for EMD (and other similar problems) in the vanilla streaming  ...  Acknowledgments We thank Mihai Budiu, Frank McSherry, and Omer Reingold for early discussions about parallel models, including systems such as Dryad and MapReduce.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1401.0042v2">arXiv:1401.0042v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xslgpd755jfk5ibz2l4k5geh2i">fatcat:xslgpd755jfk5ibz2l4k5geh2i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191025081902/https://arxiv.org/pdf/1401.0042v2.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/ab/6d/ab6d14a78f61f0c9bbd9cd41c3c79dafb83c5786.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1401.0042v2" 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>

Parallel algorithms for geometric graph problems

Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC &#39;14</a> </i> &nbsp;
We give algorithms for geometric graph problems in the modern parallel models such as MapReduce [DG04, KSV10, GSZ11, BKS13] .  ...  Our Results In this work, we focus on graph problems for geometric graphs. We assume to have n points immersed in a low-dimensional space, such as R 2 or a bounded doubling dimensional metric.  ...  Acknowledgments We thank Mihai Budiu, Frank McSherry, and Omer Reingold for early discussions about parallel models, including systems such as Dryad and MapReduce.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2591796.2591805">doi:10.1145/2591796.2591805</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/AndoniNOY14.html">dblp:conf/stoc/AndoniNOY14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jjxnujx47jgehamtyvoilgvyxe">fatcat:jjxnujx47jgehamtyvoilgvyxe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809215025/http://www.mit.edu/~andoni//papers/geomParallel.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/4e/c9/4ec9602e7a84595038dd39f4f53e62e4f46e9095.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2591796.2591805"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

AN IMPROVED PARALLEL ALGORITHM FOR A GEOMETRIC MATCHING PROBLEM WITH APPLICATION TO TRAPEZOID GRAPHS

MUHAMMAD H. ALSUWAIYEL
<span title="">2002</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cmgtml4yfbcixgymsk46sspntq" style="color: black;">Parallel Algorithms and Applications</a> </i> &nbsp;
We give an adaptive parallel algorithm to solve this problems that runs in O(log 2 n) time using the CREW PRAM with O(n 2+ / log n) processors for some , 0 < < 1.  ...  It follows that finding the minimum number of colors to color a trapezoid graph can be solved within these resource bounds.  ...  Figure 1 : A trapezoid graph. a 1 b 1 c 1 d 1 c 2 d 2 a 3 b 3 c 3 d 3 a 4 b 4 x a 2 b 2 y c 4 d 4 w x z L t L b z x y w The first parallel algorithm for this problem was proposed in [6] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/10637190208941437">doi:10.1080/10637190208941437</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5uaxgcpxyvfvrn7edkje6lywhu">fatcat:5uaxgcpxyvfvrn7edkje6lywhu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180502173801/http://eprints.kfupm.edu.sa/10647/1/gm.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/64/a4/64a4324d1083b10930a5340e08a4282e483fb637.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/10637190208941437"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> tandfonline.com </button> </a>

Geometric constraint solving with geometric transformation

Xiaoshan Gao, Leidong Huang, Kun Jiang
<span title="">2001</span> <i title="Springer Nature America, Inc"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/sjuq6iu3i5cxvlqzq3bgpwj74q" style="color: black;">Science in China Series F Information Sciences</a> </i> &nbsp;
The key of the algorithm is to combine the idea of graph based methods for geometric constraint solving and geometric transformations coming from rule-based methods.  ...  This paper proposes two algorithms for solving geometric constraint systems. The first algorithm is for constrained systems without loops and has linear complexity.  ...  A Linear Algorithm for Constraint Problems without Loops Graph Representation of Constraint Problems A constraint problem can be represented by a weighed graph [?] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf02713939">doi:10.1007/bf02713939</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/abov4njtlje6lpq4e7ufq5uv7m">fatcat:abov4njtlje6lpq4e7ufq5uv7m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060926175548/http://www.mmrc.iss.ac.cn/pub/mm19.pdf/kjiang2.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/bf/8e/bf8ecdf78680ed7af05d8f1e77e150249f879a89.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf02713939"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Graph-theoretical properties of parallelism in the digital plane

Peter Veelaert
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lx7dev2le5anbg6oarljwh7lie" style="color: black;">Discrete Applied Mathematics</a> </i> &nbsp;
We propose different graph-theoretical algorithms to partition a set of digitized lines into parallel groups, i.e., subsets in which each line is parallel to the other lines in the subset.  ...  Likewise, the parallel relations of a collection of lines is represented by an interval graph. The extraction of parallel groups is then equivalent to the detection of cliques in the interval graph.  ...  One of the conclusions of this paper is that by representing slope uncertainty by intervals, and parallel relations by interval graphs, we can derive efficient algorithms for the geometric problem of parallel  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-218x(02)00228-7">doi:10.1016/s0166-218x(02)00228-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uh5eczxzvfhe7i6i2lgmr2vpde">fatcat:uh5eczxzvfhe7i6i2lgmr2vpde</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060922022310/http://wotan.liu.edu/docis/lib/sisl/rclis/dbl/diapma/(2003)125%253A1%253C135%253AGPOPIT%253E/docent.hogent.be%252F~pvt340%252Felsdam00.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/f6/34/f6344ea3c9c61056faedefe95dc0b93670bb12c9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-218x(02)00228-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Stereo for Slanted Surfaces: First Order Disparities and Normal Consistency [chapter]

Gang Li, Steven W. Zucker
<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;
Traditional stereo algorithms either explicitly use the frontal parallel plane assumption by only considering position (zero-order) disparity when computing similarity measures of two image windows, or  ...  In particular, we develop a novel stereo algorithm that combines first-order disparity information with position (zero-order) disparity for slanted surfaces, and illustrate its use.  ...  Several algorithms address this problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11585978_40">doi:10.1007/11585978_40</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fddpsl6ndrgznd66efnkz4gbxy">fatcat:fddpsl6ndrgznd66efnkz4gbxy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921235547/http://www.cs.yale.edu/publications/techreports/tr1330.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/e1/e4/e1e49231a0729f71714100433987d6cb8f8418ff.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11585978_40"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Dynamic load balancing in computational mechanics

Bruce Hendrickson, Karen Devine
<span title="">2000</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gctv3v6plrgwthusala4ydxxeq" style="color: black;">Computer Methods in Applied Mechanics and Engineering</a> </i> &nbsp;
A number of approaches have been proposed for this dynamic load balancing problem.  ...  This paper reviews the major classes of algorithms and discusses their relative merits on problems from computational mechanics.  ...  We are indebted to Steve Plimpton, Rob Leland and Carter Edwards for a number of stimulating conversations on the topics of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0045-7825(99)00241-8">doi:10.1016/s0045-7825(99)00241-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iz6mfa3vdvbxvppipahoxevjbu">fatcat:iz6mfa3vdvbxvppipahoxevjbu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161228193421/https://cfwebprod.sandia.gov/cfdocs/CompResearch/docs/dyn_survey.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/9d/84/9d84c066a91b2e6be34d8f5fd3a9047ad554d845.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0045-7825(99)00241-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Spatial geometric constraint solving based on k-connected graph decomposition

Gui-Fang Zhang, Xiao-Shan Gao
<span title="">2006</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uo6yx5jpgnf2zl7mkrumytd4ti" style="color: black;">Proceedings of the 2006 ACM symposium on Applied computing - SAC &#39;06</a> </i> &nbsp;
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones if possible.  ...  We also show how to merge two rigid bodies if they share two or three geometric primitives in a biconnected or tri-connected graph respectively.  ...  In [13] , a method based on connectivity analysis from graph theory is proposed for solving 2D geometric constraint problems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1141277.1141510">doi:10.1145/1141277.1141510</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sac/ZhangG06.html">dblp:conf/sac/ZhangG06</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/o4zj4qaso5fcxhs2mcextj5224">fatcat:o4zj4qaso5fcxhs2mcextj5224</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170916063740/https://www.researchgate.net/profile/Xiao-Shan_Gao/publication/220998675_Spatial_geometric_constraint_solving_based_on_k-connected_graph_decomposition/links/00b7d51a5db841ba1f000000.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/99/2a991cec6206677c41dd3e4ecd0c98068151b06c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1141277.1141510"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Geometric Constraint Solving Based on Connectivity of Graph

Gui-Fang Zhang, Xiao-Shan Gao
<span title="">2004</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pi3hyyuwnfg5dd3mhrjdei4nj4" style="color: black;">Computer-Aided Design and Applications</a> </i> &nbsp;
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones if possible.  ...  We also show how to merge two rigid bodies if they share two or three geometric primitives in a bi-connected or tri-connected graph respectively.  ...  Merge bi-connected and tri-connected constraint graphs After a D-tree is obtained for a geometric constraint problem, we can solve the problem as follows: Do a left to right depth first transversal of  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/16864360.2004.10738289">doi:10.1080/16864360.2004.10738289</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6bgqzfzhvjht3fxbzjhmzuztle">fatcat:6bgqzfzhvjht3fxbzjhmzuztle</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050331091558/http://www.mmrc.iss.ac.cn:80/pub/mm22.pdf/10.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/bf/df/bfdfbaf5c82fd6ad814b923d78701b4cc0f6976e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/16864360.2004.10738289"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> tandfonline.com </button> </a>

Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions [chapter]

Seok-Hee Hong, Peter Eades, Aaron Quigley, Sang-Ho Lee
<span title="">1998</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;
In general, the problem of finding a geometric automorphism of a graph is NP-hard [7, 10] ; it may be strictly harder than the problem of finding the automorphisms of graphs in general (which is merely  ...  Geometric Automorphisms of Series Parallel Digraphs In this section we sketch an algorithm which finds geometric automorphisms for series parallel digraphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-37623-2_15">doi:10.1007/3-540-37623-2_15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5ostqgvxlrchxf7sh5zfjik2wm">fatcat:5ostqgvxlrchxf7sh5zfjik2wm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190225215236/http://pdfs.semanticscholar.org/74f3/9cb3b6aed97568f5d2d5dcf25379a51ff956.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/74/f3/74f39cb3b6aed97568f5d2d5dcf25379a51ff956.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-37623-2_15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Geometry-aware Data Partitioning Algorithm for Parallel Quad Mesh Generation on Large-scale 2D Regions

Wuyi Yu, Xin Li
<span title="">2015</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5i4djr4tgnbobnjegejzpw7nny" style="color: black;">Procedia Engineering</a> </i> &nbsp;
We formulate the partitioning problem for effective parallel quad meshing as a quadratic integer optimization problem with linear constraints.  ...  We develop a partitioning algorithm to decompose complex 2D data into small simple subregions for effective parallel quad meshing.  ...  This section illustrates that the two-step L ∞ -CVT-GP algorithm usually leads to a better data partition for the parallel meshing problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.proeng.2015.10.121">doi:10.1016/j.proeng.2015.10.121</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k4f47lns4nhzpog4gb3tfwm24i">fatcat:k4f47lns4nhzpog4gb3tfwm24i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224030839/https://core.ac.uk/download/pdf/82376168.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/36/16362980fad825b63f4ab281f153fc1e2b415613.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.proeng.2015.10.121"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Optimum tool path generation for 2.5D direction-parallel milling with incomplete mesh model

Hyun-Chul Kim
<span title="">2010</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vrhl7ochdjby5clgwshtzjfxxm" style="color: black;">Journal of Mechanical Science and Technology</a> </i> &nbsp;
First of all, a geometrically efficient tool path generation algorithm using an intersection points-graph is introduced.  ...  Hence, geometrically efficient algorithms for tool path generation, along with physical considerations for better machining productivity with guaranteed machining safety, are the most important issues  ...  In Section 3, geometric algorithms for direction-parallel path are presented.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s12206-010-0306-7">doi:10.1007/s12206-010-0306-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oykloi7hs5fsdpsumdrb2ysdp4">fatcat:oykloi7hs5fsdpsumdrb2ysdp4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810063619/http://www.j-mst.org/On_line/admin/files/02-J2008-05219_1019-1027_.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/46/df/46df58f4670e8be7d15ccd8922628b6709467f61.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s12206-010-0306-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Enabling high performance computational science through combinatorial algorithms

Erik G Boman, Doruk Bozdag, Umit V Catalyurek, Karen D Devine, Assefaw H Gebremedhin, Paul D Hovland, Alex Pothen, Michelle Mills Strout
<span title="2007-07-01">2007</span> <i title="IOP Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wxgp7pobnrfetfizidmpebi4qy" style="color: black;">Journal of Physics, Conference Series</a> </i> &nbsp;
Discrete algorithms will be increasingly critical for achieving high performance for irregular problems on petascale architectures.  ...  The Combinatorial Scientific Computing and Petascale Simulations (CSCAPES) Institute is developing algorithms and software for combinatorial problems that play an enabling role in scientific and engineering  ...  Acknowledgments Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the U. S.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1088/1742-6596/78/1/012058">doi:10.1088/1742-6596/78/1/012058</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nmz26wjnhvdgjigoj64e7jzbja">fatcat:nmz26wjnhvdgjigoj64e7jzbja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808154407/http://www.cs.odu.edu/~cscapes/coloringpage/abstracts/scidac07.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/d9/3c/d93c71a57b5546e9e0d850bc6d0fdf61507d0706.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1088/1742-6596/78/1/012058"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> iop.org </button> </a>

Mesh Partitioning Algorithm Based on Parallel Finite Element Analysis and Its Actualization

Lei Zhang, Guoxin Zhang, Yi Liu, Hailin Pan
<span title="">2013</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wpareqynwbgqdfodcyhh36aqaq" style="color: black;">Mathematical Problems in Engineering</a> </i> &nbsp;
So that it can reduce the application of the threshold of graph partitioning algorithm, improve the calculation efficiency, and promote the application of graph theory and parallel computing.  ...  In parallel computing based on finite element analysis, domain decomposition is a key technique for its preprocessing.  ...  Therefore, the time for the parallel execution of self-adaptive problem is shorter than the time for static graph partitioning.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/751030">doi:10.1155/2013/751030</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/57pnxoy7s5ealeace3pxj64bfq">fatcat:57pnxoy7s5ealeace3pxj64bfq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190505083918/http://downloads.hindawi.com/journals/mpe/2013/751030.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/ce/00/ce0072e91d2d2083f21746b94094645c2fc64a48.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/751030"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Partitioning of unstructured meshes for load balancing

Olivier C. Martin, Steve W. Otto
<span title="">1995</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/g5dm2rug7vbappj7xnqrzi3owm" style="color: black;">Concurrency Practice and Experience</a> </i> &nbsp;
Graph partitioning is This can be approximated by the problem of partitioning a graph so as to obtain a so that load balance is maximized and inter-processor communication time is minimized. memory parallel  ...  These algorithms include local search NP complete, so for real world applications, one resorts to heuristics, i.e., algorithms that minimum cut, a well-studied combinatorial optimization problem.  ...  parallel algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/cpe.4330070404">doi:10.1002/cpe.4330070404</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mrhchqiuf5dcjlvgqp3qnwkovm">fatcat:mrhchqiuf5dcjlvgqp3qnwkovm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725004110/http://cds.cern.ch/record/258993/files/P00021175.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/85/5b/855bb7ca0b853eda89b04092d1b006ddea903e4e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/cpe.4330070404"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 89,514 results