Random walks, bisections and gossiping in circulant graphs (Q486995): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s00453-013-9810-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056653457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many Random Walks Are Faster Than One / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of a random Cayley graph of ℤ q / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter and bisector size of Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient elections in chordal ring networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossiping in chordal rings under the line model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node bisectors of Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with circulant adjacency matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On small cuts separating an abelian Cayley graph into two equal parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for broadcast and gossip in the edge-disjoint modes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed algorithms in unlabeled tori and chordal rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Walks and Bisections in Random Circulant Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral Ádám property for circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters of random circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ádám's conjecture for circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static frequency assignment in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diskrepanz und Distanz von Maßen bezüglich konvexer und Jordanscher Mengen. (Discrepancy and distance of measures with respect to convex and Jordan sets) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform multi-hop all-to-all optical routings in rings. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:24, 9 July 2024

scientific article
Language Label Description Also known as
English
Random walks, bisections and gossiping in circulant graphs
scientific article

    Statements

    Random walks, bisections and gossiping in circulant graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 January 2015
    0 references
    bisection
    0 references
    circulant graphs
    0 references
    gossiping
    0 references
    random walks
    0 references
    random graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references