5
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      LATIN 2000: Theoretical Informatics : 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings 

      Fault Tolerant Reachability for Directed Graphs

      other
      , ,
      Springer Berlin Heidelberg

      Read this book at

      Buy book Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references12

          • Record: found
          • Abstract: not found
          • Article: not found

          A fast algorithm for finding dominators in a flowgraph

            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            A nearly optimal oracle for avoiding failed vertices and edges

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Oracles for Distances Avoiding a Failed Node or Link

                Bookmark

                Author and book information

                Book Chapter
                2015
                November 05 2015
                : 528-543
                10.1007/978-3-662-48653-5_35
                740d797b-1fbb-42e1-94b9-78bd633798f5
                History

                Comments

                Comment on this book

                Book chapters

                Similar content2,936

                Cited by4