Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Jia-Jie Liu"'
Publikováno v:
Theory of Computing Systems. 61:893-906
Let G(V, E) be a connected and undirected graph with n-vertex-set V and m-edge-set E. For each v ∈ V, let N(v) = {u|v ∈ V and(u, v) ∈ E}. For a positive integer k, a k-rainbow dominating function of a graph G is a function f from V(G) to a k-bi
Publikováno v:
Optimization Letters. 10:1191-1201
In this paper, we study a variant of the p-median problem on block graphs G in which the p-median is asked to be connected, and this problem is called the connected p-median problem. We first show that the connected p-median problem is NP-hard on blo
Publikováno v:
Theory of Computing Systems. 58:345-356
An outer-connected dominating set in a graph G = (V, E) is a set of vertices D ⊆ V satisfying the condition that, for each vertex v ? D, vertex v is adjacent to some vertex in D and the subgraph induced by V?D is connected. The outer-connected domi
Publikováno v:
Algorithmica. 72:430-449
Given a set S={S1,S2,?,Sl} of l strings, a text T, and a natural number k, find a string M, which is a concatenation of k strings (not necessarily distinct, i.e., a string in S may occur more than once in M) from S, whose longest common subsequence w
Publikováno v:
Theory of Computing Systems. 53:365-385
A strong alliance in a graph G=(V,E) is a set of vertices S?V satisfying the condition that, for each v?S, the number of its neighbors, including itself, in S is greater than the number of those neighbors not in S. A strong alliance S is global if S
Publikováno v:
Theory of Computing Systems. 49:588-600
A set Q⊆V is a hub set of a graph G=(V,E) if, for every pair of vertices u,v∈V∖Q, there exists a path from u to v such that all intermediate vertices are in Q. The hub number of G is the minimum size of a hub set in G. This paper derives the hu