Digraphs Theory, Algorithms and Applications

Bang-Jensen Gutin

Description

J¿rgen Bang-Jensen, Gregory GutinDigraphsTheory, Algorithms andApplications15th August 2007Springer-VerlagBerlin Heidelberg NewYorkLondon Paris TokyoHongKong BarcelonaBudapestWe dedicate this book to our parents, especially to our fathers, B¿rgeBang-Jensen and the late Mikhail Gutin, who, through their very broadknowledge, stimulated our interest in science enormously.PrefaceGraph theory is a very popular area of discrete mathematics with not onlynumerous theoretical developments, but also countless applications to prac-tical problems. As a research area, graph theory is still relatively young, butit is maturing rapidly with many deep results having been discovered overthe last couple of decades.The theory of graphs can be roughly partitioned into two branches: theareasofundirectedanddirectedgraphs(digraphs).Eventhoughbothareas have numerous important applications, for various reasons, undirectedgraphs have been studied much more extensively than directed graphs. Oneof the reasons is that undirected graphs form in a sense a special class ofdirected graphs (symmetric digraphs) and hence problems that can be for-mulated for both directed and undirected graphs are often easier for thelatter. Another reason is that, unlike for the case of undirected graphs, forwhich there are several important books covering both classical and recentresults, no previous book covers more than a small fraction of the resultsobtainedondigraphswithinthelast25years ...

Sujets

• Théorie des graphes

Informations

• Publié par: mtoledan
• Publié le: 24 août 2011
• Nombre de lectures: 107
• Langue: English
• Poids de l'ouvrage: 3 Mo

Extrait