Finding a central vertex in an HHD-free graph
نویسندگان
چکیده
منابع مشابه
Finding a central vertex in an HHD-free graph
In a graph G=(V; E), the eccentricity e(v) of a vertex v is max{d(v; u): u∈V}. The center of a graph is the set of vertices with minimum eccentricity. A house–hole–domino-free (HHD-free) graph is a graph which does not contain the house, the domino, and holes (cycles of length at least 2ve) as induced subgraphs. We present an algorithm which 2nds a central vertex of a HHD-free graph in O( 1:376...
متن کاملFinding all minimum-size separating vertex sets in a graph
We present a new algorithm based upon network flows for finding all minimum size separating vertex sets in an undirected graph. The sequential implementation of our algorithm runs in ®(mm(max(Mnk,knmmin(k,'In)),mQx(Mn,k2n3))) = 0 (2 kn3) time, where M is the number of minimum size separating vertex sets The parallel implementai 6 tion runs either in 0 (&logn) deterministic time using ©(M2n2 + k...
متن کاملConvexity and HHD-Free Graphs
It is well known that chordal graphs can be characterized via m-convexity. In this paper we introduce the notion of m-convexity (a relaxation of m-convexity) which is closely related to semisimplicial orderings of graphs. We present new characterizations of HHD-free graphs via m -convexity and obtain some results known from [B. Jamison and S. Olariu, Adv. Appl. Math., 9 (1988), pp. 364–376] as ...
متن کاملFinding minimum feedback vertex set in bipartite graph
We show that minimum feedback vertex set in a bipartite graph on n vertices can be found in 1.8621 · nO(1) time.
متن کاملVertex-to-vertex pursuit in a graph
A graph G is given and two players, a cop and a robber, play the folioking game: the cop chooses a vertex, then the robber chooses a vertex, then the players move alternately beginning with the cop. A move consists of staying at one’s present vertex or moving to an adjacent vertex; each move is seen by both players. The cop wins if he manages to occupy the same vertex as the robber, and the rob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00419-5