منابع مشابه
Approximate graph products
The problem of recognizing approximate graph products arises in theoretical biology. This paper presents an algorithm that recognizes a large class of approximate graph products. The main part of this contribution is concerned with a new, local prime factorization algorithm that factorizes all strong products on an extensive class of graphs that contains, in particular, all products of triangle...
متن کاملApproximate graph matching
In this paper, vectors are column vectors. Unless otherwise specified, the norm of a matrix ‖M‖ is the Frobenius norm, defined by ‖M‖ = √∑ i,jM 2 ij . The all ones vector is denoted 1 and the all zeros vector is denoted 0. The all ones matrix is denoted J and the all zeros matrix is denoted O. The n× n identity matrix is denoted In, or simply I if its size is understood from context. The vector...
متن کاملApproximate Homogeneous Graph Summarization
Graph patterns are able to represent the complex structural relations among objects in many applications in various domains. The objective of graph summarization is to obtain a concise representation of a single large graph, which is interpretable and suitable for analysis. A good summary can reveal the hidden relationships between nodes in a graph. The key issue is how to construct a high-qual...
متن کاملApproximate Graph Isomorphism
We study optimization versions of Graph Isomorphism. Given two graphs G1, G2, we are interested in finding a bijection π from V (G1) to V (G2) that maximizes the number of matches (edges mapped to edges or non-edges mapped to non-edges). We give an n time approximation scheme that for any constant factor α < 1, computes an α-approximation. We prove this by combining the n time additive error ap...
متن کاملGraph Similarity and Approximate Isomorphism
The graph similarity problem, also known as approximate graph isomorphism or graph matching problem, has been extensively studied in the machine learning community, but has not received much attention in the algorithms community: Given two graphs G,H of the same order n with adjacency matrices AG, AH , a well-studied measure of similarity is the Frobenius distance dist(G,H) := min π ‖AG −AH‖F ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2009
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2008.09.006