Press "Enter" to skip to content

Algorithmic Aspects of Graph Connectivity (Encyclopedia of by Hiroshi Nagamochi

By Hiroshi Nagamochi

Algorithmic points of Graph Connectivity is the 1st accomplished ebook in this significant thought in graph and community conception, emphasizing its algorithmic points. as a result of its broad functions within the fields of conversation, transportation, and creation, graph connectivity has made great algorithmic development lower than the impression of the speculation of complexity and algorithms in glossy laptop technological know-how. The e-book includes quite a few definitions of connectivity, together with edge-connectivity and vertex-connectivity, and their ramifications, in addition to similar themes equivalent to flows and cuts. The authors comprehensively speak about new innovations and algorithms that let for faster and extra effective computing, equivalent to greatest adjacency ordering of vertices. protecting either easy definitions and complicated themes, this booklet can be utilized as a textbook in graduate classes in mathematical sciences, reminiscent of discrete arithmetic, combinatorics, and operations study, and as a reference booklet for experts in discrete arithmetic and its purposes.

Show description

Read Online or Download Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications) PDF

Similar graph theory books

Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös

Combinatorics has no longer been a longtime department of arithmetic for extraordinarily lengthy: the final region of a century has visible an explosive progress within the topic. This progress has been mostly a result of doyen of combinatorialists, Paul Erdos, whose penetrating perception and insatiable interest has supplied an enormous stimulus for employees within the box.

Topological Crystallography: With a View Towards Discrete Geometric Analysis

Geometry in historic Greece is related to have originated within the interest of mathematicians concerning the shapes of crystals, with that interest culminating within the class of normal convex polyhedra addressed within the ultimate quantity of Euclid’s components. because then, geometry has taken its personal course and the examine of crystals has now not been a relevant subject matter in arithmetic, except for Kepler’s paintings on snowflakes.

Imagery in Scientific Thought Creating 20th-Century Physics

One of many nice mysteries of the human brain is its strength to create new kinds of wisdom. Arthur I. Miller is a historian of technology whose procedure has been strongly encouraged by means of present paintings in cognitive technology, and during this ebook he exhibits how the 2 fields will be fruitfully associated with yield new insights into the artistic technique.

Eigenspaces of graphs

Graph conception is a crucial department of latest combinatorial arithmetic. by means of describing fresh leads to algebraic graph conception and demonstrating how linear algebra can be utilized to take on graph-theoretical difficulties, the authors offer new options for experts in graph concept. The e-book explains how the spectral conception of finite graphs will be bolstered by way of exploiting houses of the eigenspaces of adjacency matrices linked to a graph.

Additional resources for Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications)

Sample text

The proof of this theorem will be given in the next subsection after introducing a maximum flow algorithm. 8 ([63, 72]). For an edge-weighted digraph G with a source s and a sink t, the following relation holds: max{v( f ) | (s, t)-flows f } = min{d(X ; G) | (s, t)-cuts X }. Recall that the local edge-connectivity λ(s, t; G) between two vertices s and t is defined to be min{d(X ; G) | (s, t)-cuts X }. 8 leads to the next corollary. 9. The local edge-connectivity λ(s, t; G) is equal to the flow value of a maximum (s, t)-flow in an edge-weighted digraph G.

E(L , L) (resp. (u, v) ∈ E(L , L)) (note that L does not necessarily induce a kvertex-connected subgraph from G). By definition, any subset L ⊆ V is κ L ,L vertex-connected, and, for any vertex cut C with |C| < κ L ,L , S − C is contained in the same component (resp. strongly connected component) in G − C, since κ(u, v; G − C) ≥ κ L ,L − |C| ≥ 1 holds for all {u, v} ∈ E(L − C, L − C). The next property gives a condition by which we can omit computing κT,T to determine κ(G). 22 ([65]). For a digraph G = (V, E) which is not complete, let {S, T = V − S} be a partition of V .

Note that multiple edges are all counted in the total number m = |E|. We show that Dinits’ algorithm runs faster on such digraphs. In a residual graph for an unweighted digraph, a blocking flow can be found in O(m) time because we can avoid traversing the same edge more than once. Therefore, a maximum (s, t)-flow in an unweighted digraph can be obtained in O(mn) time. Recall that, for a digraph G = (V, E), dist(s, t; G) denotes the distance from s to t. 9, λ(s, t; G) also gives the maximum value of an (s, t)-flow in G.

Download PDF sample

Rated 4.34 of 5 – based on 10 votes