𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Isomorphism for Graphs of Bounded Distance Width

✍ Scribed by K. Yamazaki; H. L. Bodlaender; B. de Fluiter; D. M. Thilikos

Book ID
105746523
Publisher
Springer
Year
1999
Tongue
English
Weight
448 KB
Volume
24
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Partitioning Graphs of Bounded Tree-Widt
Partitioning Graphs of Bounded Tree-Width
✍ Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan πŸ“‚ Article πŸ“… 1998 πŸ› Springer-Verlag 🌐 English βš– 199 KB
Layout of Graphs with Bounded Tree-Width
Layout of Graphs with Bounded Tree-Width
✍ Dujmovic, Vida; Morin, Pat; Wood, David R. πŸ“‚ Article πŸ“… 2005 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 328 KB
Efficient Parallel Algorithms for Graphs
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
✍ Jens Lagergren πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 236 KB

We present an efficient parallel algorithm for the tree-decomposition problem Ε½ 3 . Ε½. for fixed width w. The algorithm runs in time O O log n and uses O O n processors on an ARBITRARY CRCW PRAM. The sequential complexity of our tree-decom-Ε½ 2 . position algorithm is O O n log n . The tree-decomposi

On the Isomorphism Problem for Finite Ca
On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency
✍ C.H. Li; C.E. Praeger πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 187 KB

For a subset S of a group G such that 1 / ∈ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 ∈ S. Each Οƒ ∈ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S Οƒ ). For a positive integer m, th