• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Hybrid Graph Theory and Network Analysis

Hybrid Graph Theory and Network Analysis

Paperback

Series: Cambridge Tracts in Theoretical Computer Science, Book 49

General Computers

ISBN10: 0521106591
ISBN13: 9780521106597
Publisher: Cambridge University Press
Published: Sep 3 2009
Pages: 188
Weight: 0.62
Height: 0.43 Width: 6.00 Depth: 9.00
Language: English
This book combines traditional graph theory with the matroid view of graphs in order to throw light on the mathematical approach to network analysis. The authors examine in detail two dual structures associated with a graph, namely circuits and cutsets. These are strongly dependent on one another and together constitute a third, hybrid, vertex-independent structure called a graphoid, whose study is here termed hybrid graph theory. This approach has particular relevance for network analysis. The first account of the subject in book form, the text includes many new results as well as the synthesizing and reworking of much research done over the past thirty years (historically, the study of hybrid aspects of graphs owes much to the foundational work of Japanese researchers). This work will be regarded as the definitive account of the subject, suitable for all working in theoretical network analysis: mathematicians, computer scientists or electrical engineers.

1 different editions

Also available

Also in

General Computers