Cited By
View all- Asahiro YDoi YMiyano ESamizo KShimizu H(2018)Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph ProblemsAlgorithmica10.1007/s00453-017-0344-y80:6(1834-1856)Online publication date: 1-Jun-2018
In this paper we study the (in)approximability of two distance-based relaxed variants of the maximum clique problem (Max Clique), named Max d-Clique and Max d-Club: A d-clique in a graph $$G = (V, E)$$G=(V,E) is a subset $$S\subseteq V$$S⊆V of vertices ...
A packing of graphs $G_1$ and $G_2$, both on $n$ vertices, is a set $\{H_1,H_2\}$ such that $H_1\cong G_1$, $H_2\cong G_2$, and $H_1$ and $H_2$ are edge disjoint subgraphs of $K_n$. In 1978, Sauer and Spencer [J. Combin. Theory Ser. B, 25 (1978), pp. 295--...
We introduce the maximum graph homomorphism (MGH) problem: given a graph G, and a target graph H, find a mapping ϕ:VG↦VH that maximizes the number of edges of G that are mapped to edges of H. This problem encodes various fundamental NP-hard problems ...
Springer-Verlag
Berlin, Heidelberg
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in