Open AccessBook
Graph Theory
Reads0
Chats0
TLDR
Gaph Teory Fourth Edition is standard textbook of modern graph theory which covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each chapter by one or two deeper results.Abstract:
Gaph Teory Fourth Edition Th is standard textbook of modern graph theory, now in its fourth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each fi eld by one or two deeper results, again with proofs given in full detail.read more
Citations
More filters
Journal ArticleDOI
Transient Modeling of Arbitrary Pipe Networks by a Laplace-Domain Admittance Matrix
TL;DR: In this paper, a graph theoretic approach is proposed to derive a Laplace-domain network admittance matrix relating the nodal variables of pressure and demand for a network comprised of pipes, junctions, and reservoirs.
Journal ArticleDOI
Evaluating the Vulnerability of Network Traffic Using Joint Security and Routing Analysis
TL;DR: A class of continuous metrics to evaluate the vulnerability of network traffic as a function of security and routing protocols used in wireless networks and develops two complementary vulnerability definitions, allowing a network analyst or an adversary to determine weaknesses in the secure network.
Journal ArticleDOI
Computerized Argument Delphi Technique
TL;DR: The computerized version of argument Delphi is applied to real-world problems using crowd involvement through Facebook and is modeled in a graph of arguments and the problem of qualitative decision has been transferred into a graph problem using Delphi method.
Journal ArticleDOI
Packing element-disjoint steiner trees
TL;DR: A randomized O(log n)-approximation algorithm for packing element-disjoint Steiner trees is presented, thus matching the hardness lower bound and a tight upper bound of O( log n) on the integrality ratio of a natural linear programming relaxation is shown.
Proceedings ArticleDOI
Decomposing DAGs into spanning trees: A new way to compress transitive closures
Yangjun Chen,Yibin Chen +1 more
TL;DR: This paper proposes a new approach to decompose a graph into a series of spanning trees which may share common edges, to transform a reachability query over aGraph into a set of queries over trees, and demonstrates the efficiency and effectiveness of this method.
Related Papers (5)
Graduate Texts in Mathematics
Rajendra Bhatia,Glen Bredon,Wolfgang Walter,Joseph J. Rotman,M. Ram Murty,Jane Gilman,Peter Walters,Martin Golubitsky,Ioannis Karatzas,Henri Cohen,Raoul Bott,Gaisi Takeuti,Béla Bollobás,John M. Lee,Jiří Matoušek,Saunders Mac Lane,John L. Kelley,B. A. Dubrovin,Tom M. Apostol,John Stillwell,William Arveson +20 more