<--- Back to Details
First PageDocument Content
Graph theory / Random walk / PageRank / Matrix / Maximal independent set / Trapezoid graph
Date: 2008-03-31 06:45:00
Graph theory
Random walk
PageRank
Matrix
Maximal independent set
Trapezoid graph

i i “imvol3” — — 15:41 — page 445 — #1 i

Add to Reading List

Source URL: www.cs.uoi.gr

Download Document from Source Website

File Size: 798,23 KB

Share Document on Facebook

Similar Documents

Lecture 5  Maximal Independent Set 5.1  The Problem

Lecture 5 Maximal Independent Set 5.1 The Problem

DocID: 1v2MD - View Document

Noname manuscript No. (will be inserted by the editor) An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs Johannes Schneider · Roger Wattenhofer

Noname manuscript No. (will be inserted by the editor) An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs Johannes Schneider · Roger Wattenhofer

DocID: 1rvrw - View Document

Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗  Department of Computer Science,

Distributed (∆ + 1)-Coloring in Linear (in ∆) Time Leonid Barenboim∗ Michael Elkin∗ Department of Computer Science,

DocID: 1rrEj - View Document

arXiv:1505.04514v1 [cs.DC] 18 MayA Local Broadcast Layer for the SINR Network Model Magn´ us M. Halld´orsson∗

arXiv:1505.04514v1 [cs.DC] 18 MayA Local Broadcast Layer for the SINR Network Model Magn´ us M. Halld´orsson∗

DocID: 1rlA9 - View Document

Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell  Computer Engineering and Networks Laboratory

Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory

DocID: 1rcqn - View Document