Filters








335 Hits in 4.7 sec

Fixed-Parameter Tractable Distances to Sparse Graph Classes

Jannis Bulian, Anuj Dawar
2016 Algorithmica  
graph G to C is fixed-parameter tractable.  ...  We show that for various classes C of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given  ...  Moser and Thilikos [26] showed that deleting k vertices to obtain a d-regular graph is fixed-parameter tractable parameterized by k + d.  ... 
doi:10.1007/s00453-016-0235-7 fatcat:yk3piechqnec5gusen2sl7jp4u

Graph Editing Problems with Extended Regularity Constraints [article]

Luke Mathieson
2017 arXiv   pre-print
degree r are taken together as a combined parameter, the problems are tractable (i.e. in ), but are otherwise intractable.  ...  In this paper we examine generalisations of the notion of editing a graph to obtain a regular subgraph.  ...  . ∞ WDCE r 1 (v) is fixed-parameter tractable when parameterized by the treewidth of the input graph. Proof.  ... 
arXiv:1510.03482v2 fatcat:kkyxuc2hufdltiltmgykjo6ie4

Graph editing problems with extended regularity constraints

Luke Mathieson
2017 Theoretical Computer Science  
degree r are taken together as a combined parameter, the problems are tractable (i.e. in FPT), but are otherwise intractable.  ...  In this paper we examine generalisations of the notion of editing a graph to obtain a regular subgraph.  ...  . ∞ WDCE r 1 (v) is fixed-parameter tractable when parameterized by the treewidth of the input graph. Proof.  ... 
doi:10.1016/j.tcs.2017.03.019 fatcat:shacdteh4jhtrk7eyayog3ucxu

Fixed-parameter Tractable Distances to Sparse Graph Classes [article]

Jannis Bulian, Anuj Dawar
2015 arXiv   pre-print
graph G to C is fixed-parameter tractable.  ...  We show that for various classes C of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given  ...  Conclusion We are motivated by the study of the fixed-parameter tractability of edit distances in graphs.  ... 
arXiv:1502.05910v1 fatcat:uhxviaio4nfo3aahfvdks3eeuq

Modification to Planarity is Fixed Parameter Tractable

Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos, Michael Wagner
2019 Symposium on Theoretical Aspects of Computer Science  
A replacement action is a function L that maps each k-vertex labeled graph to another k-vertex graph.  ...  We consider a general family of graph modification problems, called L-Replacement to C, where the input is a graph G and the question is whether it is possible to replace in G some k-vertex subgraph H  ...  In other words, the problem is fixed-parameter tractable (FPT) parameterized by k.  ... 
doi:10.4230/lipics.stacs.2019.28 dblp:conf/stacs/FominGT19 fatcat:7njqwz7p2ja2hpuv3hlqbnldji

Graph Kernels: State-of-the-Art and Future Challenges [article]

Karsten Borgwardt, Elisabetta Ghisu, Felipe Llinares-López, Leslie O'Bray, Bastian Rieck
2020 arXiv   pre-print
Over the last two decades, numerous graph kernels, i.e. kernel functions between graphs, have been proposed to solve the problem of assessing the similarity between graphs, thereby making it possible to  ...  This manuscript provides a review of existing graph kernels, their applications, software plus data resources, and an empirical comparison of state-of-the-art graph kernels.  ...  While Ramon and Gärtner defined the neighbourhood to be specifically the out-degree neighbourhood, we will use our normal neighbourhood notation since this is equivalent to the out-degree neighbourhood  ... 
arXiv:2011.03854v2 fatcat:oatembagbjachgcmxncl2b2ioa

Percolation on Sequences of Graphs

Oliver Riordan
2011 Proceedings of the International Congress of Mathematicians 2010 (ICM 2010)  
This is important for deciding whether a graph model fits some real-world example, as well as for exploring what models are possible.  ...  Here the situation is well understood for dense graphs, but wide open for sparse graphs.  ...  Given a 'fixed' graph F , let X F (G) denote the number of subgraphs of a graph G that are isomorphic to F .  ... 
doi:10.1142/9789814324359_0158 fatcat:lf4d475eungj3mc2pvkhge4se4

Editing to Eulerian graphs

Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2016 Journal of computer and system sciences (Print)  
To the best of our knowledge, the only other natural non-trivial graph class H for which the H-Editing problem is known to be polynomialtime solvable is the class of split graphs.  ...  For any S ⊆ {ea, ed, vd}, we define Connected Degree Parity Editing(S) (CDPE(S)) to be the problem that takes as input a graph G, an integer k and a function δ : V (G) → {0, 1}, and asks whether G can  ...  It is natural to ask whether 3-CDME({ea, ed}) is fixed-parameter tractable with parameter k.  ... 
doi:10.1016/j.jcss.2015.10.003 fatcat:la5d6bkprfhxnb5jsuuu4taiqe

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh
2017 SIAM journal on computing (Print)  
We give a fixed-parameter tractable algorithm that, given a parameter k and two graphs G 1 , G 2 , either concludes that one of these graphs has treewidth at least k, or determines whether G 1 and G 2  ...  The running time of the algorithm on an n-vertex graph is 2 O(k 5 log k) · n 5 , and this is the first fixed-parameter algorithm for Graph Isomorphism parameterized by treewidth.  ...  We are grateful to Yota Otachi and Pascal Schweitzer for sharing with us their manuscript [31] and helpful comments on our work.  ... 
doi:10.1137/140999980 fatcat:ve2dhxxejjfozlwjfta4zccb6e

Semantic Analysis of Natural Language Queries Using Domain Ontology for Information Access from Database

Avinash J. Agrawal, O. G. Kakde
2013 International Journal of Intelligent Systems and Applications  
The implemented system is then evaluated and result is algorith m is widely adopted in real engineering given in section VI. Finally section VII contains conclusion and future scope.  ...  This paper describes a method for semantic analysis of natural language queries for Natural Language Interface to Database (NLIDB) using domain ontology.  ...  Th is graph wh ich is a sub-graph of the larger ontology graph of Fig.1 represents the meaning of the given natural language question.  ... 
doi:10.5815/ijisa.2013.12.07 fatcat:ujhauxwn7nfttly53m5bugrhme

Publishing Community-Preserving Attributed Social Graphs with a Differential Privacy Guarantee

Xihui Chen, Sjouke Mauw, Yunior Ramírez-Cruz
2020 Proceedings on Privacy Enhancing Technologies  
Our proposal relies on CAGM, a new community-preserving generative model for attributed graphs. We equip CAGM with efficient methods for attributed graph sampling and parameter estimation.  ...  of the original graph, as well as degree sequences and clustering coefficients.  ...  Acknowledgements This work was funded by Luxembourg's Fonds National de la Recherche, via grant C17/IS/11685812 (PrivDA).  ... 
doi:10.2478/popets-2020-0066 fatcat:n5tjamyfszcbxemqsx57g25hey

A linear kernel for finding square roots of almost planar graphs

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2017 Theoretical Computer Science  
In particular, the first result implies that the problem of recognizing squares of tree+ke graphs, that is, graphs that can be modified into trees by removing at most k edges, is fixed-parameter tractable  ...  Note that the second question corresponds to the Square Root problem restricted to graphs in G, whereas the first question is the same as asking whether a given graph has a square root in G.  ...  A parameterized problem is fixed parameter tractable (FPT) if it can be solved in time f (k) · n O (1) for some computable function f .  ... 
doi:10.1016/j.tcs.2017.05.008 fatcat:ndiwbgwovnc4hd4fwzykmbrovq

Minimal matrices in the Bruhat order for symmetric (0,1)-matrices

Henrique F. da Cruz, Rosário Fernandes, Susana Furtado
2017 Linear Algebra and its Applications  
Volume 124 (1994) of the journal Discrete Mathematics was a special edition dedicated to this conference; it was edited by Stanley Fiorini and Josef Lauri, and it consisted of 22 selected papers.  ...  each of whom gave a one-hour lecture. The third type of talks were the 20-minute contributed talks running in two parallel sessions and given by 39 speakers.  ...  We provide a characterization of ∂(G), Ct(G), and Ext(G) for the family of MOPs. We show that, unlike for trees, all containments in the Venn diagram are proper for MOPs, a subfamily of 2-trees.  ... 
doi:10.1016/j.laa.2017.05.014 fatcat:zlcp5rb2sjeqvlyaajvf2nyoby

Adversarial Attacks on Graph Classification via Bayesian Optimisation [article]

Xingchen Wan, Henry Kenlay, Binxin Ru, Arno Blaas, Michael A. Osborne, Xiaowen Dong
2021 arXiv   pre-print
Graph neural networks, a popular class of models effective in a wide range of graph-based learning tasks, have been shown to be vulnerable to adversarial attacks.  ...  We present a novel Bayesian optimisation-based attack method for graph classification models. Our method is black-box, query-efficient and parsimonious with respect to the perturbation applied.  ...  of Oxford; HK is supported by the EPSRC Centre for Doctoral Training in Autonomous Intelligent Machines and Systems EP/L015897/1; AB thanks the Konrad-Adenauer-Stiftung and the Oxford-Man Institute of  ... 
arXiv:2111.02842v1 fatcat:xyudz2vb45bbhmbvtgcdx4fxse

Editing to Eulerian Graphs [article]

Konrad K. Dabrowski and Petr A. Golovach and Pim van 't Hof and Daniël Paulusma
2014 arXiv   pre-print
For any S⊆{ea,ed,vd}, we define Connected Degree Parity Editing(S) (CDPE(S)) to be the problem that takes as input a graph G, an integer k and a function δ V(G)→{0,1}, and asks whether G can be modified  ...  We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint.  ...  most k edges, is fixed-parameter tractable when parameterized by k.  ... 
arXiv:1410.6863v1 fatcat:2s24623sznac3a2tla6otgdepm
« Previous Showing results 1 — 15 out of 335 results