Parallel maximum independent set in convex bipartite graphs

A bipartite graph G = ( V, W, E) is called convex if the vertices in W can be ordered in such a way that the elements of W adjacent to any vertex υ ϵ V form an interval (i.e. a sequence consecutively numbered vertices). Such a graph can be represented in a compact form that requires O( n) space, whe...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 59; no. 6; pp. 289 - 294
Main Authors:	Czumaj, Artur, Diks, Krzysztof, Przytycka, Teresa M.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 23.09.1996 Elsevier Science Elsevier Sequoia S.A
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Bipartite graphs Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Convex graphs Exact sciences and technology Graph theory Graphs Independent set Information processing Information retrieval. Graph Mathematics PRAM algorithms Sciences and techniques of general use Studies Theoretical computing Independent set Convex graphs PRAM algorithms Bipartite graphs Graph theory Convex graph Algorithms Convexity Bipartite graph
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!