✦ LIBER ✦

Flooding Time of Edge-Markovian Evolving Graphs

✍ Scribed by Clementi, Andrea E. F.; Macci, Claudio; Monti, Angelo; Pasquale, Francesco; Silvestri, Riccardo

Book ID: 118197806
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 263 KB
Volume: 24
Category: Article
ISSN: 0895-4801
DOI: 10.1137/090756053

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Performance of Opportunistic Epidemic Ro

Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs

✍ Whitbeck, J.; Conan, V.; de Amorim, M.D. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 209 KB

Linear-time recognition of bipartite gra

Linear-time recognition of bipartite graphs plus two edges

✍ Peter Damaschke 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 137 KB

On the time to traverse all edges of a g

On the time to traverse all edges of a graph

✍ David Zuckerman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 293 KB

4-edge-coloring graphs of maximum degree

4-edge-coloring graphs of maximum degree 3 in linear time

✍ San Skulrattanakulchai 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 65 KB

We present a linear time algorithm to properly color the edges of any graph of maximum degree 3 using 4 colors. Our algorithm uses a greedy approach and utilizes a new structure theorem for such graphs.

Polynomial Time Complexity of Edge Colou

Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes

✍ Romeo Rizzi, David Cariolaro 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 324 KB

Parallel O(log n) time edge-colouring of

Parallel O(log n) time edge-colouring of trees and Halin graphs

✍ Alan M. Gibbons; Amos Israeli; Wojciech Rytter 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 674 KB