Expander properties and the cover time of random intersection graphs (Q1034533): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sotiris E. Nikoletseas / rank
 
Normal rank
Property / author
 
Property / author: Christoforos L. Raptopoulos / rank
 
Normal rank
Property / author
 
Property / author: Paul G. Spirakis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078953993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cover time of sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison theorems for reversible Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Layout Problems on Random Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cover Time for Random Walks on Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Intersection Graphs: The Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur deux propriétés des classes d'ensembles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander Properties and the Cover Time of Random Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander properties in random regular graphs with edge faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex degree distribution of random intersection graphs / rank
 
Normal rank

Latest revision as of 03:57, 2 July 2024

scientific article
Language Label Description Also known as
English
Expander properties and the cover time of random intersection graphs
scientific article

    Statements

    Expander properties and the cover time of random intersection graphs (English)
    0 references
    6 November 2009
    0 references
    0 references
    random intersection graphs
    0 references
    random walks
    0 references
    cover time
    0 references
    mixing time
    0 references
    expansion
    0 references
    0 references