Path Problems in Graphs

@inproceedings{Rote1989PathPI,
  title={Path Problems in Graphs},
  author={G Unter Rote},
  year={1989}
}
  • G Unter Rote
  • Published 1989
A large variety of problems in computer science can be viewed from a common viewpoint as instances of \algebraic" path problems. Among them are of course path problems in graphs such as the shortest path problem or problems of nding optimal paths with respect to more generally dened objective functions; but also graph problems whose formulations do not directly involve the concept of a path, such as nding all bridges and articulation points of a graph; Moreover, there are even problems which… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 45 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Fast partial di erentiation by computer with an application to categorical dataanalysis

  • J. W. Sawyer
  • Computing
  • 1985

Simultaneous computation of functions , partial derivatives , and estimates of rounding errors

  • M. Minoux
  • Japan J . Appl . Math .
  • 1984

Generalized nested dissection

  • D. J. Rose R. J. Lipton, R. E. Tarjan
  • SIAM J . Numer . Anal .
  • 1977

Similar Papers

Loading similar papers…