Results 31 to 40 of about 75,062 (184)
Fixed-Parameter Tractable Distances to Sparse Graph Classes [PDF]
, 2015 We show that for various classes $\mathcal{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 graph $\small{G}$ to $\mathcal{C}$ is ...
A Dawar +19 more
core +2 more sources
Approximating Graph Edit Distance Using GNCCP [PDF]
, 2016 The graph edit distance (GED) is a flexible and widely used dissimilarity measure between graphs. Computing the GED between two graphs can be performed by solving a quadratic assignment problem (QAP). However, the problem is NP complete hence forbidding the computation of the optimal GED on large graphs.
Gaüzère, Benoît +2 more
openaire +2 more sources
Structural Relationship of Isomorphic Graph and its Mapping to Hamming Distance [PDF]
EPJ Web of ConferencesMapping graph isomorphism to Hamming distance enables a simple yet effective approach to quantifying structural similarity. By encoding graphs as binary adjacency vectors—flattened from the upper triangle of the adjacency matrix—structural comparisons ...
Tiwari Monika +3 more
doaj +1 more source
On the Threshold of Intractability [PDF]
, 2015 We study the computational complexity of the graph modification problems Threshold Editing and Chain Editing, adding and deleting as few edges as possible to transform the input into a threshold (or chain) graph.
A. Brandstädt +14 more
core +1 more source
Graph edit distance as a quadratic program [PDF]
2016 23rd International Conference on Pattern Recognition (ICPR), 2016 The graph edit distance (GED) measures the amount of distortion needed to transform a graph into another graph. Such a distance, developed in the context of error-tolerant graph matching, is one of the most flexible tool used in structural pattern recognition. However, the computation of the exact GED is NP-complete. Hence several suboptimal solutions,
Bougleux, Sébastien +2 more
openaire +2 more sources
Distilling Structure from Imagery:Graph-based Models for the Interpretation of Document Images
ELCVIA Electronic Letters on Computer Vision and Image Analysis, 2021 From its early stages, the community of Pattern Recognition and Computer Vision has considered the importance of leveraging the structural information when understanding images.
Pau Riba
doaj +1 more source
Optimising the Volgenant–Jonker algorithm for approximating graph edit distance [PDF]
, 2016 Although it is agreed that the Volgenant-Jonker (VJ) algorithm provides a fast way to approximate graph edit distance (GED), until now nobody has reported how the VJ algorithm can be tuned for this task. To this end, we revisit VJ and propose a series of
Chawdhary, Aziem +2 more
core +1 more source
Efficient and Scalable Graph Similarity Joins in MapReduce
The Scientific World Journal, 2014 Along with the emergence of massive graph-modeled data, it is of great importance to investigate graph similarity joins due to their wide applications for multiple purposes, including data cleaning, and near duplicate detection.
Yifan Chen +4 more
doaj +1 more source
Code Characterization With Graph Convolutions and Capsule Networks
IEEE Access, 2020 We propose SiCaGCN, a learning system to predict the similarity of a given software code to a set of codes that are permitted to run on a computational resource, such as a supercomputer or a cloud server.
Poornima Haridas +4 more
doaj +1 more source
Leveraging graph dimensions in online graph search [PDF]
, 2014 Graphs have been widely used due to its expressive power to model complicated relationships. However, given a graph database DG = {g1; g2; ··· , gn}, it is challenging to process graph queries since a basic graph query usually involves costly graph ...
Qin, L, Yu, JX, Zhu, Y
core +1 more source