Digraphs: Theory, Algorithms and Applications
Edit Page
Report
Scan day: 17 February 2014 UTC
18
Virus safety - good
Description: A comprehensive source of results, notions and open problems on directed graphs. Site offers the entire book for download as well as information on solved conjectures from the book.
Digraphs, theory, algorithms, applications Jørgen Bang-Jensen and Gregory Gutin Digraphs: Theory, Algorithms and Applications, 2nd Edition Springer Monographs in Mathematics Digraphs: Theory, Algorithms and Applications, 1st Edition
Size: 232 chars
Contact Information
Email:Send Message
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Digraphs, theory, algorithms, applications |
| Keywords: | digraphs, Graph Theory, Directed Graphs, digraphs book, oriented graph, graphs, graph algorithms, combinatorial optimization, flows, network, connectivity, distances, hamilton cycle, hamiltonian cycle, tournaments, cycle, path, edge-colored, J. Bang-Jensen, G. Gutin |
| Description: | Digraphs is the first book to present a unified and comprehensive survey of directed graphs. The book covers theoretical aspects, including detailed proofs of many important results, algorithms and applications of digraphs. The applications of digraphs and their generalizations include among other things recent developments in the Travelling Salesman Problem (TSP), genetics and network connectivity. Several open problems and conjectures will inspire further research. This book will be essential reading and reference for all graduate students, researchers and professionals in mathematics, operational research, computer science and other areas who are interested in graph theory and its applications. |
| IP-address: | 134.219.205.132 |