External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Complexity of Collapsing Reachability Graphs

Sudhir Aggarwal, Daniel Barbará, Walter Cunto, M. R. Garey. The Complexity of Collapsing Reachability Graphs. In Joseph Sifakis, editor, Automatic Verification Methods for Finite State Systems, International Workshop, Grenoble, France, June 12-14, 1989, Proceedings. Volume 407 of Lecture Notes in Computer Science, pages 264-274, Springer, 1989.

Abstract

Abstract is missing.

runs on