𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast parallel graph searching with applications

✍ Scribed by Pranay Chaudhuri

Publisher
Springer Netherlands
Year
1988
Tongue
English
Weight
952 KB
Volume
28
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast searching games on graphs
Fast searching games on graphs
✍ Donald Stanley; Boting Yang πŸ“‚ Article πŸ“… 2010 πŸ› Springer US 🌐 English βš– 518 KB
Fast parallel edge colouring of graphs
Fast parallel edge colouring of graphs
✍ G. Sajith; S. Saxena πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 241 KB

The following EREW PRAM algorithms for edge-colouring a general graph are presented: 1. an algorithm that finds a Γ°D ΓΎ dÞ-edge-colouring, 1pdoD; in Oððlog d ΓΎ Γ°D=dÞ 4 Þ log 2 nÞ time, using n ΓΎ m processors; 2. an algorithm that finds a D 1ΓΎe -edge-colouring, 0oeo1; in OΓ°log D log Γƒ nÞ time, using

Special Issue on β€œTheory and Application
Special Issue on β€œTheory and Applications of Graph Searching Problems”
✍ Fedor V. Fomin; Pierre Fraigniaud; Stephan Kreutzer; Dimitrios M. Thilikos πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 142 KB

Call for Papers Special Issue on ''Theory and Applications of Graph Searching Problems'' Manuscripts are solicited for a special issue in the journal ''Theoretical Computer Science'' (TCS) on ''Theory and Applications of Graph Searching Problems''. This special issue will be dedicated to the 60th bi