Filters








368,784 Hits in 10.6 sec

The end structure of a graph: recent results and open problems

Reinhard Diestel
<span title="">1992</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
., The end structure of a graph: recent results and open problems, Discrete Mathematics 100 (1992) 313-327.  ...  This paper aims to give a brief introduction to a set of problems, old and new, concerned with one of the main and long-standing quests in infinite graph theory: how to represent the end structure of a  ...  One-ended graphs The problem whether or not every connected graph whatsoever contains an end-faithful spanning tree remained open until very recently, and it was generally thought that the answer should  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0012-365x(92)90650-5">doi:10.1016/0012-365x(92)90650-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pyppzcxnmvhktkwpcm65dun5qu">fatcat:pyppzcxnmvhktkwpcm65dun5qu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171005113540/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/f2c/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMDEyMzY1eDkyOTA2NTA1.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/0e/f7/0ef7173ce669bcbd09eea176ac0797c440bf3326.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)90650-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Nonlinear Schrodinger equation on graphs: recent results and open problems

D. Noja
<span title="2013-12-16">2013</span> <i title="The Royal Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ercgg4vn2fenngurcnadfzdfri" style="color: black;">Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences</a> </i> &nbsp;
The emphasis is on description of concepts and results and on physical context, without reporting detailed proofs; some perspectives and more ambitious open problems are discussed.  ...  Two subjects are discussed in some detail concerning NLS equation on a star graph: the standing waves of NLS equation on a graph with a δ interaction at the vertex; the scattering of fast solitons through  ...  The author is grateful to his friends and collaborators Riccardo Adami, Claudio Cacciapuoti and Domenico Finco, with whom a large part of the material here described was developed in recent years.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1098/rsta.2013.0002">doi:10.1098/rsta.2013.0002</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/24344345">pmid:24344345</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sqrz7c5aqrfpvoypx5ld5oszaa">fatcat:sqrz7c5aqrfpvoypx5ld5oszaa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190228172918/http://pdfs.semanticscholar.org/95f1/add9680700335bc7411f160e79d9ac7d773b.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/95/f1/95f1add9680700335bc7411f160e79d9ac7d773b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1098/rsta.2013.0002"> <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>

Homogeneous manifolds whose geodesics are orbits. Recent results and some open problems [article]

Andreas Arvanitoyeorgos
<span title="2017-06-29">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We give an exposition on the subject, by presenting techniques that have been used so far and a wide selection of previous and recent results. We also present some open problems.  ...  )· o, for some non zero vector X in the Lie algebra of G.  ...  Introduction The aim of the present article is to give an exposition on developments about homogeneous geodesics in Riemannian homogeneous spaces, to present various recent results and discuss some open  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1706.09618v1">arXiv:1706.09618v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rjobu7zjubh5fce46zkwcthc2q">fatcat:rjobu7zjubh5fce46zkwcthc2q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200908013044/https://arxiv.org/pdf/1706.09618v1.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/8d/23/8d231f173231272e919adbfd6b8d496c3cb78ce7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1706.09618v1" 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>

Homogeneous manifolds whose geodesics are orbits. Recent results and some open problems

A. Arvanitoyeorgos
<span title="">2017</span> <i title="Maynooth University"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3xa6g4wddjf2hnratcsok4c4qy" style="color: black;">Irish Mathematical Society Bulletin</a> </i> &nbsp;
We give an exposition on the subject, by presenting techniques that have been used so far and a wide selection of previous and recent results.  ...  We also present some open problems.  ...  Low dimensional examples The problem of a complete classification of g.o. manifolds is open.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.33232/bims.0079.5.29">doi:10.33232/bims.0079.5.29</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cbdovwicrbh2bkd4w6phyae43m">fatcat:cbdovwicrbh2bkd4w6phyae43m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211020040526/https://www.irishmathsoc.org/bull79/Arvanitoyeorgos.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/ea/dd/eadd21c2482f8d3e4bbe78ab138a8322666910df.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.33232/bims.0079.5.29"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs [chapter]

Jiawei Gao, Ton Kloks, Sheung-Hung Poon
<span title="">2013</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 show that there is a linear-time algorithm to partition the edges of a planar graph into triangles.  ...  We show that the problem is also polynomial for toroidal graphs but NP-complete for k-planar graphs, where k 8.  ...  Our results indicate that the partitioning problem can be solved in polynomial time for graphs of fixed genus.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-36065-7_19">doi:10.1007/978-3-642-36065-7_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xip3oqjstvakzb6ldmnzany2pi">fatcat:xip3oqjstvakzb6ldmnzany2pi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171010062239/http://vixra.org/pdf/1209.0051v1.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/2f/1f/2f1f2c829ab5c311c6861e8d3ccd46f69892cf3c.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-36065-7_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Graph Clustering with Graph Neural Networks [article]

Anton Tsitsulin, John Palowitch, Bryan Perozzi, Emmanuel Müller
<span title="2020-06-30">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Graph Neural Networks (GNNs) have achieved state-of-the-art results on many graph analysis tasks such as node classification and link prediction.  ...  the challenging clustering structure of real-world graphs.  ...  End-to-end training allows to capture both graph structure and node features. • Unsupervised training is a desirable setting for clustering models.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2006.16904v1">arXiv:2006.16904v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n6u6f6q3jretxj7j6awgve7ile">fatcat:n6u6f6q3jretxj7j6awgve7ile</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200710052041/https://arxiv.org/pdf/2006.16904v1.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/2006.16904v1" 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>

Text Generation from Knowledge Graphs with Graph Transformers [article]

Rik Koncel-Kedziorski, Dhanush Bekal, Yi Luan, Mirella Lapata, Hannaneh Hajishirzi
<span title="2022-03-24">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this work, we address the problem of generating coherent multi-sentence texts from the output of an information extraction system, and in particular a knowledge graph.  ...  We introduce a novel graph transforming encoder which can leverage the relational structure of such knowledge graphs without imposing linearization or hierarchical constraints.  ...  We gratefully acknowledge the support of the European Research Council (Lapata; award number 681760). We also thank the anonymous reviewers and the UW-NLP group for their helpful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1904.02342v3">arXiv:1904.02342v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bfxvrisn3bf3vksfvm6hnpgkx4">fatcat:bfxvrisn3bf3vksfvm6hnpgkx4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220329040228/https://arxiv.org/pdf/1904.02342v3.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/a0/c7/a0c78fccbd63bcbc67d022c72e2fac998ec4ab89.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1904.02342v3" 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>

Simulation approach to study the behavior of a milling machine''s structure during end milling operation

Mounir Muhammad Farid KOURA, Muhammad Lotfy ZAMZAM, Amr Ahmed Sayed SHAABAN
<span title="">2014</span> <i title="The Scientific and Technological Research Council of Turkey"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/e7stoqbxfbd3vdgxg3mmqnnuwa" style="color: black;">Turkish Journal of Engineering and Environmental Sciences</a> </i> &nbsp;
The paper discusses the design consideration of the evaluation system, creates the system based on finite element technique, applies it to a case study, and discusses the results.  ...  This paper presents an integrated simulation system that is employed in order to evaluate the static and dynamic performance of a milling machine.  ...  The graph shows the cutting load values with respect to the end mill angle of rotation along one tooth interval.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3906/muh-1404-6">doi:10.3906/muh-1404-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bkayelo4trdcvcvkwdj4ydxc4q">fatcat:bkayelo4trdcvcvkwdj4ydxc4q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181123133430/http://journals.tubitak.gov.tr:80/engineering/issues/muh-14-38-2/muh-38-2-5-1404-6.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/f5/62/f562fb61477f791078b93fc47a2424845a3ed911.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3906/muh-1404-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Graph Database Indexing Using Structured Graph Decomposition

David W. Williams, Jun Huan, Wei Wang
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vuw5ktdyknehrehttg5qm4rfqm" style="color: black;">2007 IEEE 23rd International Conference on Data Engineering</a> </i> &nbsp;
The primary structure is a directed acyclic graph which contains a node for each of the unique, induced subgraphs of the database graphs.  ...  We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures.  ...  As a result, most meaningful definitions of similarity will result in NP-hard problems. Even a relatively simple comparison, graph isomorphism, defies a polynomial bound for the general case [12] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.2007.368956">doi:10.1109/icde.2007.368956</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icde/WilliamsHW07.html">dblp:conf/icde/WilliamsHW07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ixv4o5cwo5fdppusht5buuszjq">fatcat:ixv4o5cwo5fdppusht5buuszjq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100702055208/http://people.eecs.ku.edu/%7Ejhuan/papers/ICDEWilliams07.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/ae/37/ae37a72a5b0598fbc56b99ef0a941390722f465a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.2007.368956"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Planar Graphs as VPG-Graphs

Steven Chaplick, Torsten Ueckerdt
<span title="">2013</span> <i title="Journal of Graph Algorithms and Applications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4joumle7hffilk276fkubvhxcq" style="color: black;">Journal of Graph Algorithms and Applications</a> </i> &nbsp;
We also show that the 4-connected planar graphs constitute a subclass of the intersection graphs of Z-shapes (i.e., a special case of B2-VPG).  ...  We further show that the triangle-free planar graphs are contact graphs of: L-shapes, Γ-shapes, vertical segments, and horizontal segments (i.e., a special case of contact B1-VPG).  ...  Future Work and Open Problems We have disproved the conjecture of Asinowski et al. [2] that B 3 -VPG is the simplest B k -VPG graph class containing planar graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7155/jgaa.00300">doi:10.7155/jgaa.00300</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n3jcnccux5dqlld5yagna7mrfi">fatcat:n3jcnccux5dqlld5yagna7mrfi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705193228/http://www.maths.tcd.ie/EMIS/journals/JGAA/accepted/2013/ChaplickUeckerdt2013.17.4.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/96/08/9608cfe9be99b27d43739b51d7e1de2374125c33.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7155/jgaa.00300"> <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>

Planar Graphs as VPG-Graphs [chapter]

Steven Chaplick, Torsten Ueckerdt
<span title="">2013</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 also show that the 4-connected planar graphs constitute a subclass of the intersection graphs of Z-shapes (i.e., a special case of B2-VPG).  ...  We further show that the triangle-free planar graphs are contact graphs of: L-shapes, Γ-shapes, vertical segments, and horizontal segments (i.e., a special case of contact B1-VPG).  ...  Future Work and Open Problems We have disproved the conjecture of Asinowski et al. [2] that B 3 -VPG is the simplest B k -VPG graph class containing planar graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-36763-2_16">doi:10.1007/978-3-642-36763-2_16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zce2ircuenaldn4zonsbhjcwse">fatcat:zce2ircuenaldn4zonsbhjcwse</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705193228/http://www.maths.tcd.ie/EMIS/journals/JGAA/accepted/2013/ChaplickUeckerdt2013.17.4.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/96/08/9608cfe9be99b27d43739b51d7e1de2374125c33.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-36763-2_16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Graph Querying Meets HCI

Sourav S. Bhowmick, Byron Choi, Chengkai Li
<span title="">2017</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vxrc3vebzzachiwy3nopwi3h5u" style="color: black;">Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD &#39;17</a> </i> &nbsp;
In addition, the tutorial suggests open problems and new research directions.  ...  In summary, in this tutorial we review and summarize the research thus far into HCI and graph querying in the database community, giving researchers a snapshot of the current state of the art in this topic  ...  The final part of the tutorial presents open problems in this area. Some of these topics were introduced by recent vision papers [6, 7] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3035918.3054774">doi:10.1145/3035918.3054774</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigmod/BhowmickCL17.html">dblp:conf/sigmod/BhowmickCL17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bkzgfzi2v5gwlpgzvhx66lksua">fatcat:bkzgfzi2v5gwlpgzvhx66lksua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190218135558/https://static.aminer.org/pdf/20170130/pdfs/sigmod/q5h6klcp8bjywszta7rlfcgkpevzgnvh.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/c3/60/c3606e5e518c26a794dc0c282a959c3938b7ed53.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3035918.3054774"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

De Bruijn Graphs and DNA Graphs [chapter]

Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger
<span title="">2001</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 prove the NP-hardness of various recognition problems for subgraphs of De Bruijn graphs.  ...  As a consequence, two open questions from a recent paper by B lażewicz, Hertz, Kobler & de Werra [Discrete Applied Mathematics 98, 1999] are answered in the negative.  ...  For a non-leaf vertex v, the only possible labels of successors of v result by removing the first digit from L(v) and by appending a 0 or a 1 at its right end; this correctly encodes the tree structure  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45477-2_27">doi:10.1007/3-540-45477-2_27</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/t6uwil5uijdj3kev3imqnzrbcm">fatcat:t6uwil5uijdj3kev3imqnzrbcm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20040106044716/http://sna.csie.ndhu.edu.tw:80/~algolab/course/92a1/wg200x/2001/wg2001296.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/60/4f/604f34705c038f026c03e9c3d9e02f8627b1de27.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-45477-2_27"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Interactive graph matching and visual comparison of graphs and clustered graphs

Mountaz Hascoët, Pierre Dragicevic
<span title="">2012</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dykylhbvizgerh5htrk2qq5zti" style="color: black;">Proceedings of the International Working Conference on Advanced Visual Interfaces - AVI &#39;12</a> </i> &nbsp;
We introduce interactive graph matching, a process that conciliates visualization, interaction and optimization approaches to address the graph matching and graph comparison problems as a whole.  ...  The three case studies involve different datasets: a) subgraphs of a lexical network, b) graph of keywords extracted from the InfoVis contest benchmark, and c) clustered graphs computed from different  ...  The problem of graph comparison is to present collections of matched graphs to end users in a way that allows for easy comparison.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2254556.2254654">doi:10.1145/2254556.2254654</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/avi/HascoetD12.html">dblp:conf/avi/HascoetD12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/prgxpxstqrczljrgzalfztqv44">fatcat:prgxpxstqrczljrgzalfztqv44</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725122829/https://hal.inria.fr/file/index/docid/694422/filename/avi-2012-7.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/d5/a7/d5a75cf9dd1e996c41113cd4dde0d8ea87390cbc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2254556.2254654"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Contracting Graphs to Split Graphs and Threshold Graphs [article]

Leizhen Cai, Chengwei Guo
<span title="2013-10-22">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In these problems we are given a graph G and an integer k and asked whether G can be modified into a split graph or a threshold graph, respectively, by contracting at most k edges.  ...  We study the parameterized complexity of Split Contraction and Threshold Contraction.  ...  Recently the study of modifying a graph by using operations of edge contraction has been initiated from the parameterized point of view, yielding several results for the Π-Contraction problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1310.5786v1">arXiv:1310.5786v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yqtmw2bh4rcbhh64x7rc7diyfy">fatcat:yqtmw2bh4rcbhh64x7rc7diyfy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826014555/https://arxiv.org/pdf/1310.5786v1.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/6c/a96c815c3b862f21ac1883fbfe0d5b3f3c2fd2c2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1310.5786v1" 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 368,784 results