The Subgraph Bisimulation Problem
نویسندگان
چکیده
منابع مشابه
The Subgraph Bisimulation Problem
We study the complexity of the Subgraph Bisimulation Problem, which stands to Graph Bisimulation as Subgraph Isomorphism stands to Graph Isomorphism and we prove its NP-Completeness. Our analysis is motivated by its applications to Semistructured Databases.
متن کاملThe Subgraph Bisimulation Problem and its Complexity
In this paper we study the complexity of the Subgraph Bisimulation Problem, which stands to graph bisimulation as subgraph isomorphism stands to graph isomorphism, and we prove its NP-completeness. Our analysis is motivated by recent requirements coming from semistructured databases, where Subgraph Bisimulation can be used for retrieving semistructured data, even in presence of ‘cyclic’ queries...
متن کاملThe Anonymous Subgraph Problem
In this work we address the Anonymous Subgraph Problem (ASP). The problem asks to decide whether a directed graph contains anonymous subgraphs of a given family. This problem has a number of practical applications and here we describe three of them (Secret Santa Problem, anonymous routing, robust paths) that can be formulated as ASPs. Our main contributions are (i) a formalization of the anonym...
متن کاملThe Dense k Subgraph problem
Given a graph G = (V, E) and a parameter k, we consider the problem of finding a subset U ⊆ V of size k that maximizes the number of induced edges (DkS). We improve upon the previously best known approximation ratio for DkS, a ratio that has not seen any progress during the last decade. Specifically, we improve the approximation ratio from n 0.32258 to n 0.3159. The improved ratio is obtained b...
متن کاملThe k-Sparsest Subgraph Problem
Given a simple undirected graph G = (V,E) and an integer k ≤ |V |, the ksparsest subgraph problem asks for a set of k vertices that induce the minimum number of edges. As a generalization of the classical independent set problem, k-sparsest subgraph cannot admit (unless P = NP) neither an approximation nor an FPT algorithm (parameterized by the number of edges in the solution) in all graph clas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2003
ISSN: 1041-4347
DOI: 10.1109/tkde.2003.1209024