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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information processing letters Ročník 59; číslo 6; s. 289 - 294
Hlavní autoři:	Czumaj, Artur, Diks, Krzysztof, Przytycka, Teresa M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 23.09.1996 Elsevier Science Elsevier Sequoia S.A
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!