𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On parallel recognition of cographs

✍ Scribed by Sun-Yuan Hsieh

Book ID
108281687
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
302 KB
Volume
412
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An optimal parallel algorithm for node r
An optimal parallel algorithm for node ranking of cographs
✍ Liu Chuan-Ming; Yu Ming-Shing πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 885 KB

A ranking of a graph G is a mapping, p, from the vertices of G to the natural numbers such that for every path between any two vertices u and u, uf II, with p(u) = p(u), there exists at least one vertex w on that path with p(w) > p(u) = p(u). The value p(u) of a vertex u is the rank of vertex II. A

A fully dynamic algorithm for modular de
A fully dynamic algorithm for modular decomposition and recognition of cographs
✍ Ron Shamir; Roded Sharan πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 236 KB

The problem of dynamically recognizing a graph property calls for e ciently deciding if an input graph satisΓΏes the property under repeated modiΓΏcations to its set of vertices and edges. The input to the problem consists of a series of modiΓΏcations to be performed on the graph. The objective is to m

On the rank of a cograph
On the rank of a cograph
✍ Gerard J. Chang; Liang-Hao Huang; Hong-Gwa Yeh πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 89 KB

The rank of a graph is defined to be the rank of its adjacency matrix. Royle [G.F. Royle, The rank of a cograph, Electron. J. Combin. 10 (2003) #N11] proved a somewhat surprising result that the rank of a cograph is equal to the number of distinct non-zero rows of its adjacency matrix. In this paper