Filters








148,868 Hits in 3.9 sec

Directed Random Geometric Graphs [article]

Jesse Michel, Sushruth Reddy, Rikhav Shah, Sandeep Silwal, Ramis Movassagh
<span title="2018-08-06">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
To meet these challenges, we introduce the Directed Random Geometric Graph (DRGG) model, which is an extension of the random geometric graph model.  ...  Many real-world networks are intrinsically directed. Such networks include activation of genes, hyperlinks on the internet, and the network of followers on Twitter among many others.  ...  There is no directed edge from v to u since v lies outside of u's circle. We refer to this as the Directed Random Geometric Graph (DRGG) model, denoted by G(n, α, d).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.02046v1">arXiv:1808.02046v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bkc4rqedvreudgmwtww7o34nki">fatcat:bkc4rqedvreudgmwtww7o34nki</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191027125054/https://arxiv.org/pdf/1808.02046v1.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/26/45/2645f3860745a7032f5f3666e4dbc52eb6349425.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.02046v1" 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>

Nonuniform random geometric graphs with location-dependent radii

Srikanth K. Iyer, Debleena Thacker
<span title="">2012</span> <i title="Institute of Mathematical Statistics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/naxompb42jdozplnnzmt7yinq4" style="color: black;">The Annals of Applied Probability</a> </i> &nbsp;
We propose a distribution-free approach to the study of random geometric graphs.  ...  A vertex located at x connects via directed edges to other vertices that are within a cut-off distance r_n(x).  ...  We propose a distribution free approach to the study of random geometric graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1214/11-aap823">doi:10.1214/11-aap823</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cfoapa5twjb4tlpdkb7sdaijze">fatcat:cfoapa5twjb4tlpdkb7sdaijze</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810180552/http://www.isibang.ac.in/~statmath/icmprobsat/Abstracts/Contributed/Talk/Abstract_UserId1111_Id62.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/db/82/db82a8b6044708e8648a38ae062ee9c45c1dd9db.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1214/11-aap823"> <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>

Convergence of directed random graphs to the Poisson-weighted infinite tree

Katja Gabrysch
<span title="">2016</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3zvvh7mxurewtffxuh4aa4rccq" style="color: black;">Journal of Applied Probability</a> </i> &nbsp;
We consider a directed graph on the integers with a directed edge from vertex i to j present with probability n -1, whenever i &lt; j, independently of all other edges.  ...  We show that the closure of vertex 0 in such a weighted random graph converges in distribution to the Poisson-weighted infinite tree as n → ∞.  ...  In their survey, Aldous and Steele [4] defined rooted geometric graphs and their convergence, a framework which we use here in order to prove rigorously that the limit graph of directed random graphs  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/jpr.2016.13">doi:10.1017/jpr.2016.13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hjozrqgctbbrlh5rixe7fbdyqe">fatcat:hjozrqgctbbrlh5rixe7fbdyqe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190226063702/http://pdfs.semanticscholar.org/6a18/1d3600654ce10185c0fc83958aff60b674ac.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/6a/18/6a181d3600654ce10185c0fc83958aff60b674ac.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/jpr.2016.13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

Scale-invariant geometric random graphs

Zheng Xie, Tim Rogers
<span title="2016-03-09">2016</span> <i title="American Physical Society (APS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5pgnwkvlevhybgsbuc3q7fchx4" style="color: black;">Physical review. E</a> </i> &nbsp;
We introduce and analyze a class of growing geometric random graphs that are invariant under rescaling of space and time.  ...  Through calculations and numerical simulations we explore the consequences of scale-invariance for geometric random graphs generated this way.  ...  Minkowski space), it becomes possible to discuss dynamical random geometric graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physreve.93.032310">doi:10.1103/physreve.93.032310</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/27078369">pmid:27078369</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ebpovmv2yzbotkf2iqnavim2za">fatcat:ebpovmv2yzbotkf2iqnavim2za</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191018040257/https://arxiv.org/pdf/1505.01332v1.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/76/12/7612f33b299a3650f98107e7c278f3ff5c5ebe49.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physreve.93.032310"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> aps.org </button> </a>

Testing Euclidean Spanners [chapter]

Frank Hellweg, Melanie Schmidt, Christian Sohler
<span title="">2010</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 this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + δ)-spanner.  ...  Denition 2 Let G be a directed geometric graph and let 0 < < 1.  ...  A weighted directed geometric graph (P, E) is a directed graph whose vertex set is a set of points in the Euclidean space R d and whose edge weights (lengths) are given by the Euclidean distance of the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15775-2_6">doi:10.1007/978-3-642-15775-2_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/od5soljuxnabvpmvr3y2acessi">fatcat:od5soljuxnabvpmvr3y2acessi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110103131044/http://www.wisdom.weizmann.ac.il/~oded/PTW/cs.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/a2/8a/a28a2dc607e2aaa47efc1af049fd467445420d9f.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-15775-2_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Testing Euclidean Spanners [chapter]

Frank Hellweg, Melanie Schmidt, Christian Sohler
<span title="">2010</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 this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + δ)-spanner.  ...  Denition 2 Let G be a directed geometric graph and let 0 < < 1.  ...  A weighted directed geometric graph (P, E) is a directed graph whose vertex set is a set of points in the Euclidean space R d and whose edge weights (lengths) are given by the Euclidean distance of the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-16367-8_24">doi:10.1007/978-3-642-16367-8_24</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iqsbswappnfjfe42hdr7wbbpmu">fatcat:iqsbswappnfjfe42hdr7wbbpmu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110103131044/http://www.wisdom.weizmann.ac.il/~oded/PTW/cs.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/a2/8a/a28a2dc607e2aaa47efc1af049fd467445420d9f.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-16367-8_24"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)

Tobias Friedrich, Michael Wagner
<span title="2019-03-12">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/npfxqbtrtjcmndol3ijtu4shem" style="color: black;">Symposium on Theoretical Aspects of Computer Science</a> </i> &nbsp;
Hyperbolic random graphs are obtained by choosing random points in the hyperbolic plane and connecting pairs of points that are geometrically close.  ...  The vertices of a network can be mapped to points in this geometry, such that geometric distances are similar to graph distances.  ...  An example of such models are geometric random graphs [38] (also called random unit disk graphs).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.stacs.2019.5">doi:10.4230/lipics.stacs.2019.5</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stacs/Friedrich19.html">dblp:conf/stacs/Friedrich19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lg4hae3up5a5jfjalfgsvn77hi">fatcat:lg4hae3up5a5jfjalfgsvn77hi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200222202357/https://drops.dagstuhl.de/opus/volltexte/2019/10244/pdf/LIPIcs-STACS-2019-5.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/1d/a6/1da6aea904f8e9e05f0c1a538bb1920d3021015d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.stacs.2019.5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Including geometry in graph representations: A quadratic-time graph isomorphism algorithm and its applications [chapter]

X. Y. Jiang, H. Bunke
<span title="">1996</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;
By encoding the lost geometric information into graph representations, however, we can apply more efficient algorithms for constrained graphs.  ...  In graph representations of objects, geometric information is typically lost. This has forced researchers to use graph matching techniques that are intended to handle general graphs.  ...  [14, 15] have proposed the concept of random graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-61577-6_12">doi:10.1007/3-540-61577-6_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zdxghvq5bjdktdwote65zwaenm">fatcat:zdxghvq5bjdktdwote65zwaenm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180724070646/https://link.springer.com/content/pdf/10.1007%2F3-540-61577-6_12.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/94/9f/949f2ead283c03614112faee2c5dbe800e0a3e3f.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-61577-6_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Infinite random graphs and properties of metrics [chapter]

Anthony Bonato, Jeannette Janssen
<span title="">2016</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/krxfiqil7zgqrho7rf74zzqvpm" style="color: black;">IMA Volumes in Mathematics and its Applications</a> </i> &nbsp;
The probability that infinite random geometric graphs are isomorphic is considered.  ...  We give a survey of recent developments in the theory of countably infinite random geometric graphs.  ...  For example, special cases of the LARG model include the random geometric graphs (where p = 1), and the binomial random graph G(n, p) (where S has finite diameter D, and δ ≥ D).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-24298-9_11">doi:10.1007/978-3-319-24298-9_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/44rsfbbm55hp3oawfhdxbhbd3u">fatcat:44rsfbbm55hp3oawfhdxbhbd3u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705123043/http://www.math.ryerson.ca/%7Eabonato/papers/IMA_Survey_BJ_June26.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/f0/2e/f02e451037ff4b06d2556a113596df652653ccbf.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-319-24298-9_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Embedding graphs in Lorentzian spacetime

James R. Clough, Tim S. Evans, Naoki Masuda
<span title="2017-11-06">2017</span> <i title="Public Library of Science (PLoS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s3gm7274mfe6fcs7e3jterqlri" style="color: black;">PLoS ONE</a> </i> &nbsp;
In this work we provide a method for embedding directed acyclic graphs into Minkowski spacetime using Multidimensional scaling (MDS).  ...  Geometric approaches to network analysis combine simply defined models with great descriptive power.  ...  By a random DAG we mean an Erdős-Rényi random graph, with the nodes placed in a random order and edges directed with respect to that order, and finally the graph is transitively completed .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1371/journal.pone.0187301">doi:10.1371/journal.pone.0187301</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/29107967">pmid:29107967</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC5673185/">pmcid:PMC5673185</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kdkjb4aif5fdnocxsxwdrmx2w4">fatcat:kdkjb4aif5fdnocxsxwdrmx2w4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190426210442/http://spiral.imperial.ac.uk/bitstream/10044/1/63484/5/journal.pone.0187301%281%29.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/5e/09/5e095c719e4a6e1b5c1adddd6f5c05510b33448a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1371/journal.pone.0187301"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> plos.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5673185" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Automatic parcellation of cortical surfaces using random forests

Yu Meng, Gang Li, Yaozong Gao, Dinggang Shen
<span title="">2015</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qcepwfkflvg5toaa6fh2alj3b4" style="color: black;">2015 IEEE 12th International Symposium on Biomedical Imaging (ISBI)</a> </i> &nbsp;
In this paper, we propose a new method leveraging random forests and graph cuts methods to parcellate cortical surfaces into a set of gyral-based regions, using multiple surface atlases with manual labels  ...  Specifically, our method first takes advantage of random forests and auto-context methods to learn the optimal utilization of cortical features for rough parcellation and then the graph cuts method to  ...  random forests with graph cuts.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isbi.2015.7163995">doi:10.1109/isbi.2015.7163995</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/26405505">pmid:26405505</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC4578305/">pmcid:PMC4578305</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/isbi/MengLGS15.html">dblp:conf/isbi/MengLGS15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vfs6aana45bghjiusevjx6gozi">fatcat:vfs6aana45bghjiusevjx6gozi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191021022438/http://europepmc.org/backend/ptpmcrender.fcgi?accid=PMC4578305&amp;blobtype=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/0d/b0/0db0128860f71567d30f747b22dfdf0c6600a5d7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isbi.2015.7163995"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4578305" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Combining Speedup Techniques based on Landmarks and Containers with parallelised preprocessing in Random and Planar Graphs

R Kalpana, P Thambidurai
<span title="2011-02-28">2011</span> <i title="Academy and Industry Research Collaboration Center (AIRCC)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/plyx54ayrbefvje4gawexbdyty" style="color: black;">International Journal of Computer Science &amp; Information Technology (IJCSIT)</a> </i> &nbsp;
The experimental results were compared and analysed for determining better performance improvements in random graphs and planar graphs.  ...  PERFORMANCE OF GEOMETRIC CONTAINERS ON RANDOM GRAPHS USING GEOMETRIC CONTAINERS ON PLANAR GRAPHS Using geometric containers on planar graphs generated by LEDA had a meagre performance on the number of  ...  TECHNIQUE (PLANAR GRAPHS) CONCLUSION The speedup techniques for Dijkstra's algorithm like Landmarks and Geometric containers were analysed with random graphs and planar graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijcsit.2011.3111">doi:10.5121/ijcsit.2011.3111</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ef23a45cxjc3rdrdkqqlaz6cgi">fatcat:ef23a45cxjc3rdrdkqqlaz6cgi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180602005126/http://www.airccse.org/journal/jcsit/0211ijcsit11.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/1b/43/1b4303dd258cfa150ebfb71c6c67d5dc19e5538e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijcsit.2011.3111"> <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>

Randomized Rounding for Semidefinite Programs – Variations on the MAX CUT Example [chapter]

Uriel Feige
<span title="">1999</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;
Their algorithm first uses a semidefinite programming relaxation of MAX CUT that embeds the vertices of the graph on the surface of an n dimensional sphere, and then cuts the sphere in two at random.  ...  MAX CUT is the problem of partitioning the vertices of a graph into two sets, maximizing the number of edges joining these sets.  ...  For Karloff's graph and embedding, each of the k maximum cuts can be derived by using a hyperplane whose normal is a vector in the direction of the respective coordinate.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-48413-4_20">doi:10.1007/978-3-540-48413-4_20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lrsup62rrbghtlhlydfowkx7be">fatcat:lrsup62rrbghtlhlydfowkx7be</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190220110359/http://pdfs.semanticscholar.org/229e/7b088ee03df3f8d7c194ddc73d876e501760.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/9e/229e7b088ee03df3f8d7c194ddc73d876e501760.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-540-48413-4_20"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Network Topology Models for Multihop Wireless Networks

András Faragó
<span title="">2012</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c7qxsr5445gupcz66vrmo3hthi" style="color: black;">ISRN Communications and Networking</a> </i> &nbsp;
A typical feature of huge, random network topologies is that they are too large to allow a fully detailed description.  ...  In the current paper, we primarily focus on large, random wireless networks but also consider Web and Internet models.  ...  Generalizations of Geometric Random Graphs Premetric Random Graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5402/2012/362603">doi:10.5402/2012/362603</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2p5hoizi3vhdlapazdp7ygp7ge">fatcat:2p5hoizi3vhdlapazdp7ygp7ge</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200216055646/http://downloads.hindawi.com/archive/2012/362603.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/3c/0d/3c0d9b2d6d5749ad4c3cac1927ce75603f7db666.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5402/2012/362603"> <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>

Small Worlds and Rapid Mixing with a Little More Randomness on Random Geometric Graphs [chapter]

Gunes Ercal
<span title="">2011</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;
Let the G1 new wiring be such that we form a random cubic graph amongst the bin-leaders and superimpose this upon the random geometric graph.  ...  Let the G2 new wiring be such that we form a random 1-out graph amongst the bin-leaders and superimpose this upon the random geometric graph.  ...  Theoretical Results Random Geometric Graph Preliminaries Our analytical results for modifications of random geometric graphs are based on certain "smooth lattice-like" properties that those graphs have  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-20757-0_22">doi:10.1007/978-3-642-20757-0_22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n6ahax7lnjdr7n64njs3bsuczi">fatcat:n6ahax7lnjdr7n64njs3bsuczi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030103825/https://link.springer.com/content/pdf/10.1007%2F978-3-642-20757-0_22.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/14/89/1489fdc3121efb9ca7a4891875d4893640e8b238.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-20757-0_22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 148,868 results