A Generalized Cover Time for Random Walks on Graphs

Banderier, Cyril

Local TagsRelease HistoryDetailsSummary

A Generalized Cover Time for Random Walks on Graphs

Banderier, C. (2000). A Generalized Cover Time for Random Walks on Graphs. In Proceedings of FPSAC'00 (pp. 113-124). Heidelberg: Springer.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3369-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-336A-0

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Banderier, Cyril¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 2000

Publication Status: Issued

Pages: -

Publishing info: Heidelberg : Springer

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 518195
URI: http://algo.inria.fr/banderier/Papers/walksgraphs.ps
Other: Local-ID: C1256428004B93B8-E4CA1F668E37081DC1256B3C0044B601-Banderier2000

Degree: -

Event

show

hide

Title: Untitled Event

Place of Event: Moscow

Start-/End Date: 2000-06-26 - 2000-06-30

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of FPSAC'00

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: Heidelberg : Springer

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 113 - 124 Identifier: ISBN: 3-540-67247-8