The giant component threshold for random regular graphs with edge faults H. Prodinger (Q5941282): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127109689, #quickstatements; #temporary_batch_1722261696779 |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q4004078 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The longest path in a random graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Largest random component of a k-cube / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3682518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The isoperimetric number of random regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5538132 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the fault tolerance of the butterfly / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The critical probability of bond percolation on the square lattice equals 1/2 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4763395 / 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 / Wikidata QID | |||
Property / Wikidata QID: Q127109689 / rank | |||
Normal rank |
Latest revision as of 16:12, 29 July 2024
scientific article; zbMATH DE number 1635447
Language | Label | Description | Also known as |
---|---|---|---|
English | The giant component threshold for random regular graphs with edge faults H. Prodinger |
scientific article; zbMATH DE number 1635447 |
Statements
The giant component threshold for random regular graphs with edge faults H. Prodinger (English)
0 references
20 August 2001
0 references
communication network
0 references
regular graphs
0 references