Random regular graphs with edge faults: expansion through cores
Theoretical Computer Science
On the robustness of interconnections in random graphs: a symbolic approach
Theoretical Computer Science
Random Regular Graphs with Edge Faults: Expansion through Cores
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Trade-Offs between Density and Robustness in Random Interconnection Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Analysis of edge deletion processes on faulty random regular graphs
Theoretical Computer Science - Latin American theoretical informatics
Interval routing in reliability networks
Theoretical Computer Science - Foundations of software science and computation structures
Large independent sets in general random intersection graphs
Theoretical Computer Science
Expander properties and the cover time of random intersection graphs
Theoretical Computer Science
The second eigenvalue of random walks on symmetric random intersection graphs
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Simple and efficient greedy algorithms for hamilton cycles in random intersection graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Expander properties and the cover time of random intersection graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |