✦ LIBER ✦

On computing the diameter of real-world undirected graphs

✍ Scribed by Crescenzi, Pilu; Grossi, Roberto; Habib, Michel; Lanzi, Leonardo; Marino, Andrea

Book ID: 121738714
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 339 KB
Volume: 514
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.09.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing connected components of simple

Computing connected components of simple undirected graphs based on generalized rough sets

✍ Jinkun Chen; Jinjin Li; Yaojin Lin 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Directionality of real world networks as

Directionality of real world networks as predicted by path length in directed and undirected graphs

✍ Rosen, Yonatan; Louzoun, Yoram 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 954 KB

On the diameter of the generalized undir

On the diameter of the generalized undirected de Bruijn graphs UGB(n,m), n2 m ≤ n3

✍ Jyhmin Kuo; Hung-Lin Fu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

## Abstract The generalized de Bruijn digraph __G__~__B__~(__n__,__m__) is the digraph (__V__,__A__) where __V__ = {0, 1,…,__m__ − 1} and (__i__,__j__) ∈ __A__ if and only if __j__ ≡ __i____n__+__α__ (mod __m__) for some __α__ ∈ {0, 1, 2,…,__n__− 1}. By replacing each arc of __G__~__B__~(__n__,__m_

The targets of Real World computing

✍ Junichi Shimada 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 94 KB

On the Markov Equivalence of Chain Graph

On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

✍ Steen A. Andersson; David Madigan; Michael D. Perlman 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB

On the Diameter of Wenger Graphs

✍ Raymond Viglione 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 195 KB