Filters








33,629 Hits in 4.5 sec

Dense Graph Partitioning on sparse and dense graphs [article]

Cristina Bazgan, Katrin Casel, Pierre Cazals
<span title="2022-02-16">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper we study the restriction of Dense Graph Partition to particular sparse and dense graph classes.  ...  This problem, called Dense Graph Partition, is known to be NP-hard on general graphs and polynomial-time solvable on trees, and polynomial-time 2-approximable.  ...  [8] studied Max Dense Graph Partition, and its complement Min Sparse Graph Partition.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2107.13282v3">arXiv:2107.13282v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l2eaob2omzfizh3sdvkykrj5yy">fatcat:l2eaob2omzfizh3sdvkykrj5yy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220218004455/https://arxiv.org/pdf/2107.13282v3.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/b1/22b1d453aeb35c1da5c874f3b12c5a982ee65ef7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2107.13282v3" 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>

Dense Graph Partitioning on Sparse and Dense Graphs

Cristina Bazgan, Katrin Casel, Pierre Cazals, Artur Czumaj, Qin Xin
<span title="2022-06-22">2022</span>
In this paper we study the restriction of Dense Graph Partition to particular sparse and dense graph classes.  ...  This problem, called Dense Graph Partition, is known to be NP-hard on general graphs and polynomial-time solvable on trees, and polynomial-time 2-approximable.  ...  Max Dense Graph Partition is polynomial-time 4 3 -approximable on cubic graphs. S WAT 2 0 2 2 13:10 Dense Graph Partitioning on Sparse and Dense Graphs Proof.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.swat.2022.13">doi:10.4230/lipics.swat.2022.13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uuborddihjgivmtt2wjuircmee">fatcat:uuborddihjgivmtt2wjuircmee</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220623100446/https://drops.dagstuhl.de/opus/volltexte/2022/16173/pdf/LIPIcs-SWAT-2022-13.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/75/3775ff65d48574334e60d548b3b825ca7a55ac7d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.swat.2022.13"> <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>

Semi-External Memory Sparse Matrix Multiplication for Billion-Node Graphs

Da Zheng, Disa Mhembere, Vince Lyzinski, Joshua T. Vogelstein, Carey E. Priebe, Randal Burns
<span title="2017-05-01">2017</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ll6bfs5o6bahfinh3u5z2cnyoy" style="color: black;">IEEE Transactions on Parallel and Distributed Systems</a> </i> &nbsp;
matrix on commodity SSDs and dense matrices in memory.  ...  SEM-SpMM achieves almost 100% performance of IM-SpMM on graphs when the dense matrix has more than four columns; it achieves at least 65% performance of IM-SpMM on all inputs.  ...  Furthermore, graphs cannot be clustered or partitioned effectively [20] to localize access. Therefore, sparse matrix multiplication on graphs is frequently the bottleneck in an application.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpds.2016.2618791">doi:10.1109/tpds.2016.2618791</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n7fc34xn4rbmfgoqhuz5tiedjy">fatcat:n7fc34xn4rbmfgoqhuz5tiedjy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200823042340/https://arxiv.org/pdf/1602.02864v2.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/94/25/9425c3d0954936cc9c97a2ea439b9f2c370fa4a3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpds.2016.2618791"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

An SSD-based eigensolver for spectral analysis on billion-node graphs [article]

Da Zheng, Randal Burns, Joshua Vogelstein, Carey E. Priebe, Alexander S. Szalay
<span title="2016-02-26">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
FlashEigen performs sparse matrix multiplication in a semi-external memory fashion, i.e., we keep the sparse matrix on SSDs and the dense matrix in memory.  ...  We store the entire vector subspace on SSDs and reduce I/O to improve performance through caching the most recent dense matrix.  ...  That is, we keep dense matrices in memory and the sparse matrix on SSDs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1602.01421v3">arXiv:1602.01421v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/htnfmomwt5c2zbvo7ywjy2dkwa">fatcat:htnfmomwt5c2zbvo7ywjy2dkwa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191026040649/https://arxiv.org/pdf/1602.01421v3.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/31/cd/31cd164e8daa2c83597eb4e0e49fcf264495b0cd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1602.01421v3" 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>

Student Research Poster

Jiawen Sun
<span title="">2016</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/i2tihayjsjhmhmrqaqe2apcipy" style="color: black;">Proceedings of the 2016 International Conference on Parallel Architectures and Compilation - PACT &#39;16</a> </i> &nbsp;
Ligra optimizes the graph traversal method depending on whether the frontier, the set of currently active vertices, is densely populated or sparsely populated.  ...  We adapt the traversal routines to operate on either sparse or dense frontiers to avoid conversion of the frontier.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2967938.2971465">doi:10.1145/2967938.2971465</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/IEEEpact/Sun16.html">dblp:conf/IEEEpact/Sun16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/56m64x2zybah3j52hvfwzgwbha">fatcat:56m64x2zybah3j52hvfwzgwbha</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719084942/https://pure.qub.ac.uk/portal/files/78144834/main.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/9b/62/9b62f63d1a4381a7db3c1647ef471d2649c18296.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2967938.2971465"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Blending Extensibility and Performance in Dense and Sparse Parallel Data Management

Javier Fresno, Arturo Gonzalez-Escribano, Diego R. Llanos
<span title="">2014</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ll6bfs5o6bahfinh3u5z2cnyoy" style="color: black;">IEEE Transactions on Parallel and Distributed Systems</a> </i> &nbsp;
Our solution integrates dense and sparse data management using a common interface, that also decouples data representation, partitioning, and layout from the algorithmic and parallel strategy decisions  ...  Dealing with both dense and sparse data in parallel environments usually leads to two different approaches: To rely on a monolithic, hard-to-modify parallel library, or to code all data management details  ...  ACKNOWLEDGMENTS This research is partly supported by the Castilla-Leon Regional Government (VA172A12-2); Ministerio de Industria, Spain (CENIT OCEANLIDER); MICINN (Spain) and the European Union FEDER (  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpds.2013.248">doi:10.1109/tpds.2013.248</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ecciaa4e6razpmy24z7lefzutq">fatcat:ecciaa4e6razpmy24z7lefzutq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829111251/https://www.infor.uva.es/~jfresno/papers/jfresno_2013_tpds.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/1e/eb/1eeb11a32679175faa668e25aa94f0e0d5aff3e6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpds.2013.248"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Accelerating Graph Analytics by Utilising the Memory Locality of Graph Partitioning

Jiawen Sun, Hans Vandierendonck, Dimitrios S. Nikolopoulos
<span title="">2017</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3qrmigawsbhbljazwy2rerl5ni" style="color: black;">2017 46th International Conference on Parallel Processing (ICPP)</a> </i> &nbsp;
However, realising performance improvement through such graph partitioning poses several challenges and requires rethinking the classification of graph algorithms and preferred data structures.  ...  This paper investigates how to improve the memory locality of graph-structured analytics on large-scale shared memory systems.  ...  We evaluate our graph processing framework on a set of commonly used algorithms and graphs and demonstrate a speedup up to 4.34× over Ligra, up to 2.93× over Polymer and up to 45% over our previous version  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icpp.2017.27">doi:10.1109/icpp.2017.27</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icpp/SunVN17.html">dblp:conf/icpp/SunVN17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zzr7aonlwzbxrkqlk4kcfme2gy">fatcat:zzr7aonlwzbxrkqlk4kcfme2gy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723042546/https://pure.qub.ac.uk/ws/files/132633020/postprint_icpp.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/86/e9/86e9b49ef654bfb4c262eaa57bafa226c043d5d5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icpp.2017.27"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Parallax: Sparsity-aware Data Parallel Training of Deep Neural Networks [article]

Soojeong Kim, Gyeong-In Yu, Hojin Park, Sungwoo Cho, Eunji Jeong, Hyeonmin Ha, Sanha Lee, Joo Seong Jeong, Byung-Gon Chun
<span title="2019-06-10">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Experiments show that Parallax built atop TensorFlow achieves scalable training throughput on both dense and sparse models while requiring little effort from its users.  ...  We found that current frameworks show relatively low scalability on training NLP models due to the lack of consideration to the difference in sparsity of model parameters.  ...  During the graph transformation step, Parallax separates dense and sparse variables and creates a distributed graph for AR and PS architecture (if necessary).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.02621v3">arXiv:1808.02621v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/flymv2t6lnh23pkzivelnjby44">fatcat:flymv2t6lnh23pkzivelnjby44</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200905235332/https://arxiv.org/pdf/1808.02621v2.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fa/c1/fac1ecc23bec999a7c887821da163fcc53342f87.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.02621v3" 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>

How Good is Recursive Bisection?

Horst D. Simon, Shang-Hua Teng
<span title="">1997</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wbdvoluxebgjhn3wq3qsnldey4" style="color: black;">SIAM Journal on Scientific Computing</a> </i> &nbsp;
Our negative result is complemented by two positive ones: first we show that for some important classes of graphs that occur in practical applications, such as well-shaped finite-element and finite-difference  ...  It first divides a graph or a mesh into two equal-sized pieces, by a "good" bisection algorithm, and then recursively divides the two pieces.  ...  We would like to thank David Bailey and Jim Ruppert for their careful proofreading of the draft and helpful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/s1064827593255135">doi:10.1137/s1064827593255135</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a5nwjywnkfhz3p46ak6nk63qga">fatcat:a5nwjywnkfhz3p46ak6nk63qga</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190216024152/http://pdfs.semanticscholar.org/0027/5e6d134aea5602b048fc587cf33d6860d6a9.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/00/27/00275e6d134aea5602b048fc587cf33d6860d6a9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/s1064827593255135"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Dense Subgraph Extraction with Application to Community Detection

Jie Chen, Yousef Saad
<span title="">2012</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ht3yl6qfebhwrg7vrxkz4gxv3q" style="color: black;">IEEE Transactions on Knowledge and Data Engineering</a> </i> &nbsp;
This paper presents a method for identifying a set of dense subgraphs of a given sparse graph.  ...  The problem of identifying dense subgraphs helps analyze graph structures and complex networks and it is known to be challenging.  ...  The authors would like to thank Arindam Banerjee for introducing us to the dense subgraph problem and in particular for bringing to our attention the importance of finding a partial clustering of the graph  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tkde.2010.271">doi:10.1109/tkde.2010.271</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fv7s5ww6jvdgzg2xob7w5zwsg4">fatcat:fv7s5ww6jvdgzg2xob7w5zwsg4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812124238/http://pages.di.unipi.it/gemignani//community_detection.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/dd/1f/dd1fb11024cdf5f8191aa3927fa39a1546017251.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tkde.2010.271"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs [article]

Yunus Emre Demirci and Tınaz Ekim and Mehmet Akif Yıldız
<span title="2021-07-26">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we investigate a variant of Ramsey numbers called defective Ramsey numbers where cliques and independent sets are generalized to k-dense and k-sparse sets, both commonly called k-defective  ...  We focus on the computation of defective Ramsey numbers restricted to some subclasses of perfect graphs.  ...  Acknowledgments The authors acknowledge the support of the The Scientific and Technological Research Council of Turkey (TÜBİTAK) Grant no:118F397.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2107.12031v1">arXiv:2107.12031v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s4waxe2m7be73cnphhiigliyfy">fatcat:s4waxe2m7be73cnphhiigliyfy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210730000118/https://arxiv.org/pdf/2107.12031v1.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/a9/07/a9070453e2e414452411d965b3bc42d3fd341bd2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2107.12031v1" 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>

An approximate blow-up lemma for sparse pseudorandom graphs

Peter Allen, Julia Böttcher, Hiệp Hàn, Yoshiharu Kohayakawa, Yury Person
<span title="">2013</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fhi2xwpnh5gmlgof2idwu5wlgq" style="color: black;">Electronic Notes in Discrete Mathematics</a> </i> &nbsp;
We state a sparse approximate version of the blow-up lemma, showing that regular partitions in su ciently pseudorandom graphs behave almost like complete partite graphs for embedding graphs with maximum  ...  We show that (p, )-jumbled graphs, with = o(p max(2 , +3/2) n), are "su ciently pseudorandom". The approach extends to random graphs G n,p with p log n n 1/ .  ...  Let R be any graph on r  T vertices and H a graph with (H)  and an R-partition V (H) = X 1[ · · ·[X r .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.endm.2013.10.061">doi:10.1016/j.endm.2013.10.061</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/unehq3cnibfkva4s5q5tfit7xy">fatcat:unehq3cnibfkva4s5q5tfit7xy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200709110650/https://www.ime.usp.br/%7Ehh/Abstracts/approx_blowup_lagos13.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/9b/04/9b049223a5d9c5e242ef3877fd6ef536e8568852.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.endm.2013.10.061"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

MODELS DEVELOPMENT FOR SINGLE–ROW NETWORKS FROM CONNECTED GRAPHS

SER LEE LOH, SHAHARUDDIN SALLEH, NOR HANIZA SARMIN
<span title="2013-02-15">2013</span> <i title="Penerbit UTM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xgym76lve5dw7bbeqkndyfil2u" style="color: black;">Jurnal Teknologi</a> </i> &nbsp;
The collection involves three specific models for perfect binary trees, trees and partially dense graphs, and three general models for connected graphs.  ...  network; transformation; connected graph; tree; simulated annealing ^Äëíê~â.  ...  A sparsely connected graph is a connected graph with relatively few edges. The sparsely connected graph in this research is assumed to have one unit of weight for each edge.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11113/jt.v57.1529">doi:10.11113/jt.v57.1529</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cugqsuf4j5h5zaz6hybkigpykq">fatcat:cugqsuf4j5h5zaz6hybkigpykq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721005555/https://jurnalteknologi.utm.my/index.php/jurnalteknologi/article/download/1529/1188" 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/db/e5/dbe5dae5a7d35709082cfb19e23d000a67a5de60.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11113/jt.v57.1529"> <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>

Subject Index

<span title="">2006</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/usw2n4yaarcurchx7i4on2iqea" style="color: black;">Journal of Discrete Algorithms</a> </i> &nbsp;
matching Distributed algorithms for weighted problems in sparse graphs, 588 Media-on-Demand Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging, 72 Median Linear  ...  k-degenerate graph Dense trees: a new look at degenerate graphs, 455 k-dense forest Dense trees: a new look at degenerate graphs, 455 k-dense tree Dense trees: a new look at degenerate graphs, 455  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1570-8667(06)00094-3">doi:10.1016/s1570-8667(06)00094-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e5in7ez4svbdlcjyzzev4xkzhm">fatcat:e5in7ez4svbdlcjyzzev4xkzhm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170924211153/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/1c1/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMTU3MDg2NjcwNjAwMDk0Mw%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/4e/f3/4ef328d7dc2c17a1d4cbaf3488afbe4306cac50f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1570-8667(06)00094-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

FeatGraph: A Flexible and Efficient Backend for Graph Neural Network Systems [article]

Yuwei Hu, Zihao Ye, Minjie Wang, Jiali Yu, Da Zheng, Mu Li, Zheng Zhang, Zhiru Zhang, Yida Wang
<span title="2020-09-29">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
FeatGraph speeds up end-to-end GNN training and inference by up to 32x on CPU and 7x on GPU.  ...  FeatGraph incorporates optimizations for graph traversal into the sparse templates and allows users to specify optimizations for UDFs with a feature dimension schedule (FDS).  ...  The authors affiliated with Cornell University were funded in part by CRISP, one of six centers in JUMP, a Semiconductor Research Corporation (SRC) program sponsored by DARPA, and by AFRL and DARPA under  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2008.11359v2">arXiv:2008.11359v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pm5cdwjlj5bfdk547w3r2lwv7q">fatcat:pm5cdwjlj5bfdk547w3r2lwv7q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201001001242/https://arxiv.org/pdf/2008.11359v2.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] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2008.11359v2" 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 33,629 results