An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.The Chinese postman problem for undirected graphs We describe here how to find a shortest (non-simple) circuit in a weighted, undirected, non-Eulerian graph such that each edge is traversed at least once. Any postmana#39;s circuit, shortest oranbsp;...

Title | : | Algorithmic Graph Theory |

Author | : | Alan Gibbons |

Publisher | : | Cambridge University Press - 1985-06-27 |

Continue