Diagraphs: Theory, Algorithms and Applications

Front Cover
Springer Science & Business Media, 2002 - Mathematics - 754 pages
0 Reviews
The study of directed graphs has developed enormously over recent decades, yet no book covers more than a tiny fraction of the results from more than 3000 research articles on the topic. Digraphs is the first book to present a unified and comprehensive survey of the subject. In addition to covering the theoretical aspects, including detailed proofs of many important results, the authors present a number of algorithms and applications. The applications of digraphs and their generalizations include among other things recent developments in the Travelling Salesman Problem, genetics and network connectivity. More than 700 exercises and 180 figures will help readers to study the topic while 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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

I
1
III
2
IV
6
V
10
VI
16
VII
18
VIII
22
IX
25
CLI
348
CLII
349
CLIII
353
CLIV
355
CLV
358
CLVI
362
CLVII
367
CLVIII
368

X
28
XI
29
XII
35
XIII
38
XIV
45
XV
46
XVI
48
XVII
50
XIX
52
XX
53
XXI
55
XXII
58
XXIII
59
XXV
60
XXVI
61
XXVII
63
XXVIII
67
XXIX
69
XXX
71
XXXI
74
XXXIII
75
XXXIV
78
XXXVI
79
XXXVII
80
XXXVIII
82
XL
84
XLI
85
XLII
86
XLIII
89
XLIV
95
XLVI
96
XLVII
98
XLVIII
99
L
100
LI
101
LII
102
LIII
104
LIV
105
LV
108
LVI
110
LVII
113
LVIII
114
LX
116
LXI
117
LXII
122
LXIV
124
LXV
125
LXVI
127
LXVII
128
LXVIII
131
LXIX
134
LXX
137
LXXII
141
LXXIII
142
LXXIV
143
LXXV
147
LXXVI
171
LXXVII
172
LXXVIII
175
LXXIX
176
LXXX
179
LXXXI
182
LXXXII
187
LXXXIII
191
LXXXIV
195
LXXXV
198
LXXXVI
200
LXXXVII
202
LXXXVIII
203
LXXXIX
207
XC
209
XCI
211
XCII
215
XCIII
219
XCIV
221
XCV
224
XCVI
227
XCVII
229
XCVIII
230
XCIX
232
C
233
CI
234
CII
235
CIII
237
CIV
238
CV
240
CVII
246
CVIII
248
CIX
250
CX
251
CXI
253
CXII
256
CXIII
259
CXIV
264
CXV
265
CXVI
269
CXVII
273
CXVIII
276
CXIX
281
CXX
282
CXXI
284
CXXIII
289
CXXIV
292
CXXV
295
CXXVI
299
CXXVIII
300
CXXIX
303
CXXX
306
CXXXI
308
CXXXII
309
CXXXIII
312
CXXXV
315
CXXXVI
317
CXXXVII
318
CXXXVIII
321
CXXXIX
326
CXLI
329
CXLII
331
CXLIV
332
CXLV
334
CXLVI
335
CXLVII
337
CXLVIII
339
CXLIX
345
CL
346
CLIX
370
CLX
371
CLXI
373
CLXII
376
CLXIII
378
CLXIV
381
CLXV
382
CLXVI
387
CLXVII
391
CLXVIII
392
CLXIX
393
CLXX
395
CLXXI
400
CLXXII
404
CLXXIII
405
CLXXIV
406
CLXXV
408
CLXXVI
409
CLXXVII
415
CLXXIX
416
CLXXX
419
CLXXXI
421
CLXXXII
424
CLXXXIII
429
CLXXXIV
432
CLXXXV
435
CLXXXVI
437
CLXXXVII
443
CLXXXVIII
446
CXC
450
CXCI
451
CXCII
452
CXCIII
453
CXCIV
457
CXCV
458
CXCVI
462
CXCVII
467
CXCVIII
475
CXCIX
476
CC
477
CCI
478
CCII
482
CCIII
484
CCIV
487
CCV
492
CCVI
493
CCVII
497
CCVIII
500
CCIX
503
CCX
506
CCXI
507
CCXII
510
CCXIII
511
CCXIV
517
CCXV
520
CCXVI
522
CCXVII
527
CCXIX
528
CCXX
535
CCXXI
536
CCXXII
538
CCXXIII
545
CCXXIV
546
CCXXV
549
CCXXVI
553
CCXXVIII
554
CCXXIX
557
CCXXX
561
CCXXXII
563
CCXXXIII
565
CCXXXIV
567
CCXXXV
568
CCXXXVI
570
CCXXXVII
573
CCXXXVIII
577
CCXXXIX
580
CCXL
583
CCXLI
584
CCXLII
586
CCXLIII
591
CCXLIV
592
CCXLV
594
CCXLVI
597
CCXLVII
601
CCXLVIII
604
CCXLIX
607
CCL
613
CCLI
615
CCLII
620
CCLIII
621
CCLIV
624
CCLV
626
CCLVI
627
CCLVII
628
CCLVIII
629
CCLIX
630
CCLX
632
CCLXI
634
CCLXII
635
CCLXIII
636
CCLXIV
639
CCLXVI
642
CCLXVIII
645
CCLXX
646
CCLXXI
647
CCLXXII
650
CCLXXIV
653
CCLXXV
654
CCLXXVI
658
CCLXXVII
664
CCLXXVIII
665
CCLXXIX
667
CCLXXX
668
CCLXXXI
669
CCLXXXII
670
CCLXXXIII
671
CCLXXXIV
672
CCLXXXV
673
CCLXXXVI
677
CCLXXXVII
683
CCLXXXVIII
717
CCLXXXIX
723
CCXC
731
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 708 - Finding Two Disjoint Paths between Two Pairs of Vertices in a Graph,
Page 686 - Bang-Jansen and P. Hell, The effect of two cycles on the complexity of colourings by directed graphs, Discrete Appl. Math. 26 (1990), 1-23.
Page 707 - EF Moore. The Shortest Path Through a Maze. In Proc. of the Int. Symp. on the Theory of Switching, pages 285-292. Harvard University Press, 1959.
Page 686 - J. Bang-Jensen, G. Gutin, and A. Yeo. A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs, J. Graph Theory 29 (1998), 111-132.
Page 713 - In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 42-5 1 , New York/Philadelphia, Jan.
Page 711 - Finding a minimal transitive reduction in a strongly connected digraph within linear time. In: Graph-theoretic concepts in computer science, Proc.

References to this book

All Book Search results »

Bibliographic information