Filters








254 Hits in 6.1 sec

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices [article]

Gauvain Devillez, Alain Hertz, Hadrien Mélot, Pierre Hauweele
<span title="2018-09-10">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Also, given two integers n and p with p≤ n-1, we characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of order n with p pending vertices.  ...  The eccentric connectivity index of a connected graph G is the sum over all vertices v of the product d_G(v) e_G(v), where d_G(v) is the degree of v in G and e_G(v) is the maximum distance between v and  ...  Minimizing ξ c for graphs with fixed order and fixed number of pending vertices Let G be a connected graph of order n ≥ 4 with p pending vertices. Clearly, p ≤ n − 1, and G ≃ S n,1 if p = n − 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1809.03158v1">arXiv:1809.03158v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ytw5foyuy5dend2a4vzskgfuye">fatcat:ytw5foyuy5dend2a4vzskgfuye</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200929140721/https://arxiv.org/pdf/1809.03158v1.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/d7/1a/d71abb8e55dc19a25ce925669f15b1e603ff27e1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1809.03158v1" 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>

Bounds and conjectures for the signless Laplacian index of graphs

Pierre Hansen, Claire Lucas
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wsx3rzhpingfvewcn5nwhfkq3e" style="color: black;">Linear Algebra and its Applications</a> </i> &nbsp;
number, clique number, chromatic number and matching number, Randić index, l(n) and u(n) are best possible lower and upper bounds function of the order n of G.  ...  number, clique number, chromatic number, matching number, and Randić index, l(n) and u(n) are best possible lower and upper bounds function of the order n of G.  ...  Acknowledgements We thank Mustapha Aouchiche for discussions and comments on the first draft of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.laa.2010.01.027">doi:10.1016/j.laa.2010.01.027</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k4qsrexspzf6fdj5l6g5y4pb4y">fatcat:k4qsrexspzf6fdj5l6g5y4pb4y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190413224917/https://core.ac.uk/download/pdf/82402948.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/b7/6c/b76c5b29c371dc4d0965329c8978de67553e062b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.laa.2010.01.027"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number

Mustapha Aouchiche, Gunnar Brinkmann, Pierre Hansen
<span title="">2008</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;
A set of vertices S in a graph G is independent if no neighbor of a vertex of S belongs to S. The independence number α is the maximum cardinality of an independent set of G.  ...  In the present paper, we report on such lower and upper bounds considering, as second invariant, minimum, average and maximum degree, diameter, radius, average distance, spread of eccentricities, chromatic  ...  For any connected graph on n ≥ 3 vertices with minimum degree δ and independence number α, 3 ≤ α + δ ≤ n.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.dam.2008.03.011">doi:10.1016/j.dam.2008.03.011</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7vjrggmznnhy7iavpbeqdokrli">fatcat:7vjrggmznnhy7iavpbeqdokrli</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170926190042/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/439/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDE2NjIxOHgwODAwMTQwNg%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/36/74/3674d51f3ed08be167a1a47cfbcbbc30769b98f6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.dam.2008.03.011"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Read networks and k-laminar graphs [article]

Finn Völkel and Eric bapteste and Michel Habib and Philippe Lopez and Chloe Vigliotti
<span title="2016-03-03">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
For the recognition of k-laminar graphs, we develop polynomial algorithms when k is fixed. For k=1, our algorithm improves a Deogun and Krastch's algorithm (1999).  ...  This bio-inspired class of graphs was motivated by a biological application dealing with sequence similarity networks of reads (called hereafter read networks for short).  ...  Acknowledgements: The authors wish to thank Anthony Herrel for many discussions on the project and for having selected the lizards on which this study is based.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1603.01179v1">arXiv:1603.01179v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ngyvsunv3jevppfandkttfajka">fatcat:ngyvsunv3jevppfandkttfajka</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200825155158/https://arxiv.org/pdf/1603.01179v1.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/b3/a4/b3a4fe44b600d419d287556d582968f429762b88.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1603.01179v1" 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>

Fully polynomial FPT algorithms for some classes of bounded clique-width graphs [chapter]

David Coudert, Guillaume Ducoffe, Alexandra Popa
<span title="">2018</span> <i title="Society for Industrial and Applied Mathematics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ja7dpjgz2nhjlovlil3ij5m7ei" style="color: black;">Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms</a> </i> &nbsp;
A central technique used to tackle the difficulty of the above mentioned problems is fixed-parameter algorithms with polynomial dependency in the fixed parameter (P-FPT).  ...  We give hardness results and P-FPT algorithms, using cliquewidth and some of its upper-bounds as parameters.  ...  The modular-width 1 of G, denoted by mw(G), is the minimum k ≥ 2 such that any prime subgraph in the modular decomposition has order (number of vertices) at most k.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9781611975031.176">doi:10.1137/1.9781611975031.176</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/soda/CoudertDP18.html">dblp:conf/soda/CoudertDP18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ktq2zmjnyjbfvkkbbz5udkpi3y">fatcat:ktq2zmjnyjbfvkkbbz5udkpi3y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723102616/https://hal.inria.fr/hal-01676187/file/P-FPT-2018.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/2d/24/2d24e41881effd2f65cef6ed3fe4aee153e236f5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9781611975031.176"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Some history of the development of graffiti [chapter]

Ermelinda DeLaVina
<span title="2007-06-07">2007</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vvrs4aeb5fbclnb6drlj6n6v5i" style="color: black;">DIMACS Series in Discrete Mathematics and Theoretical Computer Science</a> </i> &nbsp;
This paper provides some history of the development of the conjecturemaking computer program, Graffiti. In the process, its old and new heuristics are discussed and demonstrated.  ...  A note of gratitude is extended to Siemion Fajtlowicz for allowing the author access to all current and old code of the two versions of Graffiti.  ...  The author wishes to thank Inga Matthews for her interest in the project and the many suggestions, which helped improve this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/dimacs/069/06">doi:10.1090/dimacs/069/06</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/dimacs/DeLaVina01a.html">dblp:conf/dimacs/DeLaVina01a</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zfphesxm55alzo3rekuzsoxiee">fatcat:zfphesxm55alzo3rekuzsoxiee</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100717164813/http://cms.uhd.edu/faculty/delavinae/GPC/history.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/72/28/7228f6168621d01cddd3ca0c5a9a98b1fa0ac426.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/dimacs/069/06"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A survey of automated conjectures in spectral graph theory

M. Aouchiche, P. Hansen
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wsx3rzhpingfvewcn5nwhfkq3e" style="color: black;">Linear Algebra and its Applications</a> </i> &nbsp;
This paper presents a survey and a discussion of such results.  ...  Many results about graph eigenvalues were first conjectured, and in some cases proved, using computer programs, such as GRAPH, Graffiti, Ingrid, newGRAPH and Auto-GraphiX.  ...  Let G be a connected graph on n 3 vertices with index λ 1 and matching number μ.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.laa.2009.06.015">doi:10.1016/j.laa.2009.06.015</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/duexmmzlvvcmxllerpt5ohjvdm">fatcat:duexmmzlvvcmxllerpt5ohjvdm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171004223335/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/e7b/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAyNDM3OTUwOTAwMzA2MQ%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/73/ed/73eda6339d2ea058baf986ee6fc3059e17008a98.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.laa.2009.06.015"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Fully polynomial FPT algorithms for some classes of bounded clique-width graphs [article]

David Coudert COATI,
<span title="2017-10-18">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
A central technique used to tackle the difficulty of the above mentioned problems is fixed-parameter algorithms for polynomial-time problems with polynomial dependency in the fixed parameter (P-FPT).  ...  Parameterized complexity theory has enabled a refined classification of the difficulty of NP-hard optimization problems on graphs with respect to key structural properties, and so to a better understanding  ...  Roughly, we reverse the roles of vertices v 2i with even index with the roles of vertices v 2i−1 with odd index.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1707.05016v2">arXiv:1707.05016v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qogbvqxlmba5npiyzxhb2xcwa4">fatcat:qogbvqxlmba5npiyzxhb2xcwa4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200929172558/https://arxiv.org/pdf/1707.05016v2.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/d6/da/d6daaa2b6b6f194ea3c5d1cb711dd97c604e1e9a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1707.05016v2" 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>

Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs

David Coudert, Guillaume Ducoffe, Alexandru Popa
<span title="2019-06-07">2019</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xjsyokeq6nawdowtypazhyoyli" style="color: black;">ACM Transactions on Algorithms</a> </i> &nbsp;
The well-known modular decomposition of a graph is a hierarchical decomposition that partitions the vertices of the graph with respect to the modules [71] .  ...  A central technique used to tackle the difficulty of the above mentioned problems is fixed-parameter algorithms with polynomial dependency in the fixed parameter (P-FPT).  ...  Acknowledgements We wish to thank the referees for their careful reading of the first version of this manuscript, and their useful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3310228">doi:10.1145/3310228</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yx262bgipvebfi7p3sh6xl5kfq">fatcat:yx262bgipvebfi7p3sh6xl5kfq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200313040909/https://hal.archives-ouvertes.fr/hal-02152971/document" 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/4d/374dfed7f55e6c00f9b90c08f74d86da44540796.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3310228"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A Robot-Centered Path-Planning Algorithm for Multidirectional Additive Manufacturing for WAAM Processes and Pure Object Manipulation

Markus Schmitz, Jan Wiartalla, Markus Gelfgren, Samuel Mann, Burkhard Corves, Mathias Hüsing
<span title="2021-06-22">2021</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/smrngspzhzce7dy6ofycrfxbim" style="color: black;">Applied Sciences</a> </i> &nbsp;
While the introduced method enables the generation of reachable printing paths, the smoothing algorithm allows for the execution of the path with respect to the robot's velocity limits and at the same  ...  Previous algorithms for slicing, path planning or trajectory planning of additive manufacturing cannot be used consistently for multidirectional additive manufacturing with pure object manipulation in  ...  We thank Lukas Oster, Kuhshal Parmar and Rahul Sharma for useful discussions. Conflicts of Interest: The authors declare no conflict of interest.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/app11135759">doi:10.3390/app11135759</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rm4zdemdc5ft7kx6wtgtjsyz54">fatcat:rm4zdemdc5ft7kx6wtgtjsyz54</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210624032955/https://res.mdpi.com/d_attachment/applsci/applsci-11-05759/article_deploy/applsci-11-05759.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/c5/da/c5da44504a5fc5d75d8937c55539c323ec12ef37.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/app11135759"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Quantitative Assessment of the Timing and Tuning of Visual-Related, Saccade-Related, and Delay Period Activity in Primate Central Thalamus

Melanie T. Wyder, Dino P. Massoglia, Terrence R. Stanford
<span title="">2003</span> <i title="American Physiological Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nr2f6gixzrgdlloxlemhfdztdi" style="color: black;">Journal of Neurophysiology</a> </i> &nbsp;
account of the activity of these areas in association with voluntary, goal-directed movement is lacking.  ...  Quantitative assessment of the timing and tuning of visual-related, saccade-related, and delay period activity in primate central thalamus. .  ...  Pearson for providing essential programming support. D I S C L O S U R E S This work was supported by National Eye Institute Grant EY-12389.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1152/jn.00064.2003">doi:10.1152/jn.00064.2003</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/12724361">pmid:12724361</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/x4tpqvvsgbcbnpc6wduwtz33ti">fatcat:x4tpqvvsgbcbnpc6wduwtz33ti</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030090055/https://www.physiology.org/doi/pdf/10.1152/jn.00064.2003" 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/75/d2/75d295a623d6e8770b42f03c0ba20c8eaa624bdb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1152/jn.00064.2003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

On the complexity of Broadcast Domination and Multipacking in digraphs [article]

Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
<span title="2020-05-02">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
for a few classes of undirected graphs.  ...  A multipacking is a set S of vertices of D such that for each vertex v of D and for every integer d, there are at most d vertices from S within directed distance at most d from v.  ...  A digraph is strongly connected if for any two vertices u, v, there is a directed path from u to v, and weakly connected if its underlying undirected graph is connected.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2003.10570v2">arXiv:2003.10570v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/o3yn4lpamncxzctu33zngnxxbe">fatcat:o3yn4lpamncxzctu33zngnxxbe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200827052536/https://arxiv.org/pdf/2003.10570v2.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/0e/9b0e1d7d65acfd5e2815f5f6b7b8fc0ff63dc0aa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2003.10570v2" 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>

Limitation of oscillations of vibrating machines during start-up and shutdown

V.B. Vynohradov, V.I. Samusya, D.L. Kolosov
<span title="">2019</span> <i title="International Society of Philosophy and Cosmology"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xulmg7v3crfuriytz4znrgilce" style="color: black;">Naukovyi Visnyk Natsionalnoho Hirnychoho Universytetu</a> </i> &nbsp;
Differential equations for vertical vibrations of a vi brating machine mounted on rubbercord air springs, the cavities of which are filled with compressed air and communicated with additional volumes in  ...  In order to avoid the resonance vibration amplitudes in the working element at a critical rotational speed and inadmissibly large dy namic loads on the fixed supporting structure of a vi brating machine  ...  A multifactor analysis of the rail transport car that passes over a joint unevenness with respect to the phases of its motion.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.29202/nvngu/2019-1/6">doi:10.29202/nvngu/2019-1/6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5noutf4fvrbi5bz6ld4gq3zwou">fatcat:5noutf4fvrbi5bz6ld4gq3zwou</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430103427/http://nvngu.in.ua/jdownloads/pdf/2019/01/01_2019_Vynohradov.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/82/43/8243a0e9830cb669b583a92a8aacdf278d79834b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.29202/nvngu/2019-1/6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

LAYSTREAM: Composing standard gossip protocols for live video streaming

Miguel Matos, Valerio Schiavoni, Etienne Riviere, Pascal Felber, Rui Oliveira
<span title="">2014</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ob4nyu5my5hp5hj6r33huq53xu" style="color: black;">14-th IEEE International Conference on Peer-to-Peer Computing</a> </i> &nbsp;
We discuss and present solutions for these, such as a novel topology construction mechanism able to cope with the specificities of a large-scale and delay-sensitive environment, but also with requirements  ...  Well-principled gossip-based protocols have been proposed in the literature for each of these aspects.  ...  para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project FCOMP -01-0124-FEDER-022701 and by Project Smart-grids -NORTE-07-0124-FEDER-000056, co-financed by the North  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/p2p.2014.6934297">doi:10.1109/p2p.2014.6934297</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/p2p/MatosSRFO14.html">dblp:conf/p2p/MatosSRFO14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cjz66senc5hezpmpqesqmorsdy">fatcat:cjz66senc5hezpmpqesqmorsdy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705075435/http://members.unine.ch/etienne.riviere/publications/MaScRiFeOl-P2P-14.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/d4/0f/d40faba5e8347f51eb93f26a8f202a6a8993fc7a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/p2p.2014.6934297"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A Manual Transportable Instrument Platform for Ground-Based Spectro-Directional Observations (ManTIS) and the Resultant Hyperspectral Field Goniometer System

Marcel Buchhorn, Reinhold Petereit, Birgit Heim
<span title="2013-11-26">2013</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/taedaf6aozg7vitz5dpgkojane" style="color: black;">Sensors</a> </i> &nbsp;
The patented low-cost and lightweight ManTIS instrument platform can be customized for various research needs and is available for purchase.  ...  The spectro-goniometer consists of a Manual Transportable Instrument platform for ground-based Spectro-directional observations (ManTIS), and a hyperspectral sensor system.  ...  This work is part of the AWI -hy-ARK-VEG‖ project sponsored by the German Research Center for Aeronautics and Space (DLR) and funded by the German Federal Ministry of Economics and Technology (support  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/s131216105">doi:10.3390/s131216105</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fr2hqh5usjdgbcno6rvh6icaiy">fatcat:fr2hqh5usjdgbcno6rvh6icaiy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160117235241/http://www.mdpi.com:80/1424-8220/13/12/16105/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/d2/ff/d2ff191545042cd16c4f2de14af977717ea8522c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/s131216105"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 254 results