Connectivity and inference problems for temporal networks

This publication has 13 references indexed in Scilit:

• Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
  Published by Association for Computing Machinery (ACM) ,1999
• Vulnerability of scheduled networks and a generalization of Menger's Theorem
  Networks, 1996
• Graph Minors .XIII. The Disjoint Paths Problem
  Journal of Combinatorial Theory, Series B, 1995
• The complexity of finding two disjoint paths with min-max objective function
  Discrete Applied Mathematics, 1990
• A survey of gossiping and broadcasting in communication networks
  Networks, 1988
• Epidemic algorithms for replicated database maintenance
  Published by Association for Computing Machinery (ACM) ,1987
• A Problem with Telephones
  SIAM Journal on Algebraic Discrete Methods, 1981
• The directed subgraph homeomorphism problem
  Theoretical Computer Science, 1980
• A Cure for the Telephone Disease
  Canadian Mathematical Bulletin, 1972
• Gossips and telephones
  Discrete Mathematics, 1972