Filters








4,425 Hits in 3.7 sec

Applications of polyhedral combinatorics to multicommodity flows and compact surfaces [chapter]

A. Schrijver
<span title="1991-04-03">1991</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;
We survey results on graphs and curves on compact surfaces and outline the proof methods, which make essential use of polyhedral combinatorics.  ...  We derive results on planar multicommodity flows. 1980 Mathematics Subject Classification ( 1985. Primary 05C l 0, 05C38, 90B 10, 90C27.  ...  Let G be a 4-regular graph embedded on the compact orientable surface S.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/dimacs/001/12">doi:10.1090/dimacs/001/12</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/dimacs/Schrijver90.html">dblp:conf/dimacs/Schrijver90</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oh2cmkmxnnd47fr6c4bxbo37ga">fatcat:oh2cmkmxnnd47fr6c4bxbo37ga</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720151156/https://ir.cwi.nl/pub/2357/2357D.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/93/62/93620f6c745c22647d31531147071389df983e8d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/dimacs/001/12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Graph minors. III. Planar tree-width

Neil Robertson, P.D Seymour
<span title="">1984</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/g6u5fful5vcr3a7gppc6y47el4" style="color: black;">Journal of combinatorial theory. Series B (Print)</a> </i> &nbsp;
The "tree-width" of a graph is defined and it is proved that for any fixed planar graph H, every planar graph with sutliciently large tree-width has a minor isomorphic to H.  ...  For every graph G which has no minor isomorphic to H but which can be embedded in S, there exists X E V(G) with IX\< k such that G\X can be embedded on a surface of genus <g.  ...  A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contraction. If H # G it is a proper minor.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0095-8956(84)90013-3">doi:10.1016/0095-8956(84)90013-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/345gc7o3d5f3he4nkelsxcgu7e">fatcat:345gc7o3d5f3he4nkelsxcgu7e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190228193402/https://core.ac.uk/download/pdf/82078173.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/1f/af/1fafe0013162e7e7154950ac710d18d8c2971295.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0095-8956(84)90013-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Graph minors. V. Excluding a planar graph

Neil Robertson, P.D Seymour
<span title="">1986</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/g6u5fful5vcr3a7gppc6y47el4" style="color: black;">Journal of combinatorial theory. Series B (Print)</a> </i> &nbsp;
Pbsa (concerning the maximum number of disjoint circuits in a graph) to planar structures other than circuits.  ...  We prove that for every planar graph H there is a number w such that every graph with no minor isomorphic to H can be constructed from graphs with at most w vertices, by piecing them together in a tree  ...  In Section 8 we give a new application of ( 1.5) , generalizing the Erdos-Posa theorem on the maximum number of disjoint circuits in a graph . Let us clarify some terminology.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0095-8956(86)90030-4">doi:10.1016/0095-8956(86)90030-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/onzqv3np2vhpdokhcf2pdx7jou">fatcat:onzqv3np2vhpdokhcf2pdx7jou</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190227090321/https://core.ac.uk/download/pdf/82296533.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/1c/aa/1caac7479b2ff059a11d8b5221e2b82470162fb8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0095-8956(86)90030-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

On Matroid Representability and Minor Problems [chapter]

Petr Hliněný
<span title="">2006</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;
We prove this problem is hard, and so is the related problem of minor testing in rational matroids. The results hold even if we restrict to matroids of branch-width three.  ...  In this paper we look at complexity aspects of the following problem (matroid representability) which seems to play an important role in structural matroid theory: Given a rational matrix representing  ...  The author would in particular like to express his thanks to an anonymous referee of the paper [9] , who suggested to extend our complexity results (on spikes and swirls) in the direction towards the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11821069_44">doi:10.1007/11821069_44</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yj6qfi6vpzg6dggookp5niiszm">fatcat:yj6qfi6vpzg6dggookp5niiszm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081123115702/http://www.fi.muni.cz/~hlineny/Research/papers/mrepres-mfcs.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/41/7e/417e8f42b0b4d3bf2e0fdd2fc28ccf7ca3435845.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11821069_44"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Graph polynomials and their applications II: Interrelations and interpretations [article]

Joanna Ellis-Monaghan, Criel Merino
<span title="2008-06-28">2008</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for  ...  We conclude with two examples, one from biology and one from physics, that illustrate the applicability of graph polynomials in other fields.  ...  Let A(G) be the adjacency matrix of a graph G. Then f (G; x) = |xIA(G)|.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0806.4699v1">arXiv:0806.4699v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4qzf6mxhsrgqzkgcz4xm2jimau">fatcat:4qzf6mxhsrgqzkgcz4xm2jimau</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0806.4699/0806.4699.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0806.4699v1" 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>

Approximate MAP Estimation for Pairwise Potentials via Baker's Technique [article]

Yi-Kai Wang
<span title="2018-04-17">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We show that computing MAX 2-CSP admits polynomial-time approximation scheme (PTAS) on planar graphs, graphs with bounded local treewidth, H-minor-free graphs, geometric graphs with bounded density and  ...  We propose a unified framework to model these computation tasks where the structures of these optimization problems are encoded by functions attached on the vertices and edges of a graph.  ...  on some surfaces on which H cannot be embedded.Theorem 4.4 says that any H-minor-free graph G can be expressed as a "tree structure" of pieces, where each piece can be embedded on a surface on which H  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1412.0340v4">arXiv:1412.0340v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bwu3jpcq3fc5bgpugzpvmfwnri">fatcat:bwu3jpcq3fc5bgpugzpvmfwnri</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200903153614/https://arxiv.org/pdf/1412.0340v4.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/25/ab25971e4eaa8ef6512d81e8e0ba74a0b5bf6ba9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1412.0340v4" 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>

Checking the convexity of polytopes and the planarity of subdivisions

Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
<span title="">1998</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/is2k7576zbherpepqy3y7zkzuy" style="color: black;">Computational geometry</a> </i> &nbsp;
An ordering qJ of a graph induces a set of directed circuits, where the edge (v, w) following (u, v) in a circuit is the successor of (u, v) in the circular ordering of the edges incident on v.  ...  Points Pi (i = ] ..... k) belong to a closed curve in a (since f' is a surface without boundary).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0925-7721(98)00039-x">doi:10.1016/s0925-7721(98)00039-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y3eox33r2rfolf4qeri63hrire">fatcat:y3eox33r2rfolf4qeri63hrire</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060911120642/http://www.cs.brown.edu/research/pubs/pdfs/1998/Devillers-1998-CCP.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/71/de/71de4d5797a250f9512f921728f8edfe98c70d54.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0925-7721(98)00039-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Embeddings of graphs

Carsten Thomassen
<span title="">1994</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
We survey some recent results on graphs embedded in higher surfaces or general topological spaces. 0012-365X/94/$07.00 0 1994-Elsevier Science B.V. All rights reserved SSDI 0012-365X(92)00062-V  ...  In these lectures we concentrate on graph embeddings on compact 2-dimensional surfaces. Such embeddings play a central role in the deep theory on minors by Robertson and Seymour [13] .  ...  Instead of starting with a surface S and drawing a graph G on S, we start with G and use it as a 'skeleton' for a surface.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0012-365x(92)00062-v">doi:10.1016/0012-365x(92)00062-v</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2dzynzlujfemteeuqtjlexdzhe">fatcat:2dzynzlujfemteeuqtjlexdzhe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190417232832/https://core.ac.uk/download/pdf/82124243.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/fa/bb/fabbf59e7bdce11c64718313528567fb37f1c890.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0012-365x(92)00062-v"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Paths in Graphs and Curves on Surfaces [chapter]

Alexander Schrijver
<span title="">1994</span> <i title="Birkhäuser Basel"> First European Congress of Mathematics Paris, July 6–10, 1992 </i> &nbsp;
Menger's theorem is a basic result in graph theory, and several other theorems in graph theory utilize Menger's theorem in some way.  ...  A classical result in graph theory due to the topologist Menger [24] concerns the existence of pairwise internally vertex-disjoint paths connecting two given vertices r and s in an undirected graph G =  ...  This makes paths and minors in the graph easier to handle by using the topology of the surface, for instance, by classifying paths (and more generally graphs) on the surface by their homotopic properties  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-0348-9112-7_16">doi:10.1007/978-3-0348-9112-7_16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sh6mbgc7u5cfzlioderpxoausu">fatcat:sh6mbgc7u5cfzlioderpxoausu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719065237/https://ir.cwi.nl/pub/2220/2220D.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/61/ae/61ae184277bd22b42f648c8bdbae38fc88f72b2f.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-0348-9112-7_16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Graph minors. VII. Disjoint paths on a surface

Neil Robertson, P.D Seymour
<span title="">1988</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/g6u5fful5vcr3a7gppc6y47el4" style="color: black;">Journal of combinatorial theory. Series B (Print)</a> </i> &nbsp;
., sk, I~ be vertices of a graph G drawn in a surface Z. When are there k vertex-disjoint paths of G linking s, and t, (1 <i< k)?  ...  Our results are applied to yield a polynomially bounded algorithm to solve the problem for fixed C and k.  ...  A forest in a surface C is a proper graph in C with no circuits.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0095-8956(88)90070-6">doi:10.1016/0095-8956(88)90070-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tlkkgizlozbvnnd4re2zs2beqi">fatcat:tlkkgizlozbvnnd4re2zs2beqi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171005143004/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/f55/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMDk1ODk1Njg4OTAwNzA2.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/a8/c7/a8c78c24bc9e927cd759b7253541781a30444c90.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0095-8956(88)90070-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Some Recent Progress and Applications in Graph Minor Theory

Ken-ichi Kawarabayashi, Bojan Mohar
<span title="">2007</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yxooi3wjmbgqtbp7l4evjeuj4i" style="color: black;">Graphs and Combinatorics</a> </i> &nbsp;
Recently, a number of beautiful results that use this structural result have appeared. Some of these along with some other recent advances on graph minors are surveyed.  ...  In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the "rough" structure of graphs excluding a fixed minor.  ...  The main result of Graph Minors XI [141] roughly states the following.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00373-006-0684-x">doi:10.1007/s00373-006-0684-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wkf3w6cemzc4hnnw3neqpck6hu">fatcat:wkf3w6cemzc4hnnw3neqpck6hu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190225155450/http://pdfs.semanticscholar.org/64ad/59ea9819097ffd8732d3dc79160330996b85.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/ad/64ad59ea9819097ffd8732d3dc79160330996b85.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00373-006-0684-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Graph minors. VIII. A kuratowski theorem for general surfaces

Neil Robertson, P.D Seymour
<span title="">1990</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/g6u5fful5vcr3a7gppc6y47el4" style="color: black;">Journal of combinatorial theory. Series B (Print)</a> </i> &nbsp;
As a consequence, for any surface .Z there is a finite list of graphs, such that a general graph may be drawn in Z if an only if it topologically contains none of the graphs in the list. 0 1990 Academic  ...  We prove that for any infinite set of graphs of bounded genus, some member of the set is isomorphic to a minor of another.  ...  While the presence of the boundary has no effect on the embedding capabilities of the surface, it enables us to work only with graphs drawn on a surface where the root vertices are the ones that lie on  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0095-8956(90)90121-f">doi:10.1016/0095-8956(90)90121-f</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mbqhosxu4bfg7dfde3zmxfllui">fatcat:mbqhosxu4bfg7dfde3zmxfllui</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190309190351/https://core.ac.uk/download/pdf/82368223.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/59/36591422c1634a882ce3f511bee22a17fb8541b2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0095-8956(90)90121-f"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Developing an Empirical Relationship to Predict the Wear Characteristics of Ni-Based Hardfaced Deposits on Nuclear Grade 316LN Austenitic Stainless Steel

S. Gnanasekaran, Samson Jerold Samuel Chelladurai, G. Padmanaban, Ramesh Arthanari, V. Balasubramanian, Alicia E. Ares
<span title="2021-10-14">2021</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nazmmg5rvjamleddfnihvz3cai" style="color: black;">Advances in Materials Science and Engineering</a> </i> &nbsp;
A power of 1300 W, powder feed rate of 9 g/min, travel speed of 350 mm/min, and defocusing distance of 32 mm were all combined to achieve a minimum weight loss of 0.0164 grams.  ...  The tribological characteristics of a reactor-grade material NiCr-B hardfaced deposit were studied and reported in this paper.  ...  surface of wear test specimen Co-efficient of frication graph SEM Image (b) (C) Top surface of wear test specimen Co-efficient of frication graph SEM Image 100 μm (c) Table 8 :  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2021/3934787">doi:10.1155/2021/3934787</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ubcqoqcepnc5dowcdqefnhyhbm">fatcat:ubcqoqcepnc5dowcdqefnhyhbm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211019213532/https://downloads.hindawi.com/journals/amse/2021/3934787.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/ad/1d/ad1dd4eee6a083684de783eebb6682f49266851c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2021/3934787"> <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>

Fixed-Parameter Tractability and Completeness I: Basic Results

Rod G. Downey, Michael R. Fellows
<span title="">1995</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7dys7zoberdktmxyjciuy5bnse" style="color: black;">SIAM journal on computing (Print)</a> </i> &nbsp;
For many fixed-parameter problems that are trivially soluable in polynomial time, such as (k-)DOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions  ...  We also give a compendium of currently known hardness results as an appendix.  ...  The general version of this problem is P SP AC E-complete by a reduction from QBF (see Garey and Johnson [81, GP1] [2] ). Acknowledgments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/s0097539792228228">doi:10.1137/s0097539792228228</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lrps5o3r3jg7jcy7ellmmdytoa">fatcat:lrps5o3r3jg7jcy7ellmmdytoa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150115112854/http://homepages.ecs.vuw.ac.nz/~downey/publications/1.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/95/1495d20f1cc8100a00252636287df5be4f015ca9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/s0097539792228228"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Genetic design automation for autonomous formation of multicellular shapes from a single cell progenitor [article]

Evan Appleton, Noushin Mehdipour, Tristan Daifuku, Demarcus Briers, Iman Haghighi, Michael Moret, George Chao, Timothy Wannier, Anush Chiappino-Pepe, Calin Belta, George M Church
<span title="2019-10-16">2019</span> <i title="Cold Spring Harbor Laboratory"> bioRxiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Here we describe a computer-aided design approach for designing recombinase-based genetic circuits for controlling the formation of multi-cellular masses into arbitrary shapes in human cells.  ...  Multi-cellular organisms originate from a single cell, ultimately giving rise to mature organisms of heterogeneous cell type composition in complex structures.  ...  It determines which surface proteins need to be expressed by each cell, then groups cells based on these proteins 142 and determines a pathway to go from one cell to the final population. 143 The module  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1101/807107">doi:10.1101/807107</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vzmekhlgdze5hdqa7hukndllli">fatcat:vzmekhlgdze5hdqa7hukndllli</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200215153921/https://www.biorxiv.org/content/biorxiv/early/2019/10/16/807107.full.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 noreferrer" href="https://doi.org/10.1101/807107"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> biorxiv.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 4,425 results