Professional Documents
Culture Documents
Combinatorial Optimization and Applications 12th International Conference COCOA 2018 Atlanta GA USA December 15 17 2018 Proceedings Donghyun Kim
Combinatorial Optimization and Applications 12th International Conference COCOA 2018 Atlanta GA USA December 15 17 2018 Proceedings Donghyun Kim
https://textbookfull.com/product/combinatorial-optimization-and-
applications-14th-international-conference-cocoa-2020-dallas-tx-
usa-december-11-13-2020-proceedings-weili-wu/
https://textbookfull.com/product/combinatorial-optimization-and-
applications-8th-international-conference-cocoa-2014-wailea-maui-
hi-usa-december-19-21-2014-proceedings-1st-edition-zhao-zhang/
https://textbookfull.com/product/web-and-internet-economics-14th-
international-conference-wine-2018-oxford-uk-
december-15-17-2018-proceedings-george-christodoulou/
https://textbookfull.com/product/algorithmic-aspects-in-
information-and-management-12th-international-conference-
aaim-2018-dallas-tx-usa-december-3-4-2018-proceedings-shaojie-
Brain Informatics International Conference BI 2018
Arlington TX USA December 7 9 2018 Proceedings Shouyi
Wang
https://textbookfull.com/product/brain-informatics-international-
conference-bi-2018-arlington-tx-usa-
december-7-9-2018-proceedings-shouyi-wang/
https://textbookfull.com/product/information-systems-
security-14th-international-conference-iciss-2018-bangalore-
india-december-17-19-2018-proceedings-vinod-ganapathy/
https://textbookfull.com/product/conceptual-modeling-33rd-
international-conference-er-2014-atlanta-ga-usa-
october-27-29-2014-proceedings-1st-edition-eric-yu/
https://textbookfull.com/product/security-privacy-and-applied-
cryptography-engineering-8th-international-conference-
space-2018-kanpur-india-december-15-19-2018-proceedings-anupam-
chattopadhyay/
https://textbookfull.com/product/security-privacy-and-anonymity-
in-computation-communication-and-storage-spaccs-2019-atlanta-ga-
usa-july-14-17-2019-proceedings-guojun-wang/
Donghyun Kim · R. N. Uma
Alexander Zelikovsky (Eds.)
LNCS 11346
Combinatorial Optimization
and Applications
12th International Conference, COCOA 2018
Atlanta, GA, USA, December 15–17, 2018
Proceedings
123
Lecture Notes in Computer Science 11346
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board
David Hutchison
Lancaster University, Lancaster, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Friedemann Mattern
ETH Zurich, Zurich, Switzerland
John C. Mitchell
Stanford University, Stanford, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
C. Pandu Rangan
Indian Institute of Technology Madras, Chennai, India
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbrücken, Germany
More information about this series at http://www.springer.com/series/7407
Donghyun Kim R. N. Uma
•
Combinatorial Optimization
and Applications
12th International Conference, COCOA 2018
Atlanta, GA, USA, December 15–17, 2018
Proceedings
123
Editors
Donghyun Kim Alexander Zelikovsky
Department of Computer Science Department of Computer Science
Kennesaw State University Georgia State University
Marietta, GA, USA Atlanta, GA, USA
R. N. Uma
Department of Mathematics
and Computer Science
North Carolina Central University
Durham, NC, USA
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
General Co-chairs
Zhipeng Cai Georgia State University, USA
Jon A. Preston Kennesaw State University, USA
Web Chair
Seokjun Lee Kennesaw State University, USA
Publication Chair
Daehee Seo Kennesaw State University, USA
Finance Chair
Brian Ellis Kennesaw State University, USA
Program Committee
Annie Chateau University of Montpellier 2, France
Yong Chen Hangzhou University of Electronic Science
and Technology, China
Ovidiu Daescu University of Texas at Dallas, USA
Zhenhua Duan Xidian University, China
Thomas Erlebach University of Leicester, UK
Neng Fan University of Arizona, USA
Stanley Fung University of Leicester, UK
Satish Govindarajan Indian Institute of Science, India
Meng Han Kennesaw State University, USA
Micheal Khachay Ural Federal University, Russia
Milos Kudelka Technical University of Ostrava, Czech Republic
VIII Organization
Additional Reviewers
Graph Theory
Combinatorial Optimization
Clustering
Miscellaneous
1 Introduction
The diameter diam(G) and the radius rad(G) of a graph G = (V, E) are two
fundamental metric parameters that have many important practical applications
in real world networks. The problem of finding the center C(G) of a graph G
is often studied as a facility location problem for networks where one needs to
select a single vertex to place a facility so that the maximum distance from any
demand vertex in the network is minimized. In the analysis of social networks
(e.g., citation networks or recommendation networks), biological systems (e.g.,
protein interaction networks), computer networks (e.g., the Internet or peer-
to-peer networks), transportation networks (e.g., public transportation or road
networks), etc., the eccentricity ecc(v) of a vertex v is used to measure the
1
importance of v in the network: the centrality index of v is defined as ecc(v) .
c Springer Nature Switzerland AG 2018
D. Kim et al. (Eds.): COCOA 2018, LNCS 11346, pp. 3–18, 2018.
https://doi.org/10.1007/978-3-030-04651-4_1
4 V. Chepoi et al.
Being able to compute efficiently the diameter, center, radius, and vertex
centralities of a given graph has become an increasingly important problem in
the analysis of large networks. The algorithmic complexity of the diameter and
radius problems is very well-studied. For some special classes of graphs there are
efficient algorithms [1,7,12,16,29]. However, for general graphs, the only known
algorithms computing the diameter and the radius exactly compute the distance
between every pair of vertices in the graph, thus solving the all-pairs shortest
paths problem (APSP) and hence computing all eccentricities. In view of recent
negative results [1,6,36], this seems to be the best what one can do since even
for graphs with m = O(n) (where m is the number of edges and n is the number
of vertices) the existence of a subquadratic time (that is, O(n2− ) time for some
> 0) algorithm for the diameter or the radius problem will refute the well
known Strong Exponential Time Hypothesis (SETH). Furthermore, recent work
[2] shows that if the radius of a possibly dense graph (m = O(n2 )) can be
computed in subcubic time (O(n3− ) for some > 0), then APSP also admits
a subcubic algorithm. Such an algorithm for APSP has long eluded researchers,
and it is often conjectured that it does not exist.
Motivated by these negative results, researches started devoting more atten-
tion to development of fast approximation algorithms. In the analysis of large-
scale networks, for fast estimations of diameter, center, radius, and centrality
indices, linear or almost linear time algorithms are desirable. One hopes also for
the all-pairs shortest paths problem to have o(nm) time small-constant–factor
approximation algorithms. In general graphs, both diameter and radius can be
2-approximated by a simple linear time algorithm which picks any node and
reports its eccentricity. A 3/2-approximation algorithm for the diameter and the
2/3
radius which runs in Õ(mn√ ) time was recently obtained in [10] (see also√[4]
2
for an earlier Õ(n + m n) time algorithm and [36] for a randomized Õ(m n)
time algorithm). For the sparse graphs, this is an o(n2 ) time approximation
algorithm. Furthermore, under plausible assumptions, no O(n2− ) time algo-
rithm can exist that (3/2 − )-approximates (for , > 0) the diameter [36] and
the radius [1] in sparse graphs. Similar results are known also for all eccentric-
ities: a 5/3-approximation to the eccentricities of all vertices can be computed
in Õ(m3/2 ) time [10] and, under plausible assumptions, no O(n2− ) time algo-
rithm can exist that (5/3 − )-approximates (for , > 0) the eccentricities of
all vertices in sparse graphs [1]. Better approximation algorithms are known for
some special classes of graphs [13,19,24,25].
Approximability of APSP is also extensively investigated. An additive 2-
approximation for APSP in unweighted undirected graphs (the graphs we con-
sider in this paper) was presented in [20]. It runs in Õ(min{n3/2 m1/2 , n7/3 }) time
and hence improves the runtime of an earlier algorithm from [4]. In [5], an Õ(n2 )
time algorithm was designed which computes an approximation of all distances
with a multiplicative error of 2 and an additive error of 1. Furthermore, [5] gives
an O(n2.24+o(1) −3 log(n/)) time algorithm that computes an approximation of
all distances with a multiplicative error of (1 + ) and an additive error of 2.
Fast Approximation of Centrality and Distances in Hyperbolic Graphs 5
Better algorithms are known for some special classes of graphs (see [7,13,23]
and papers cited therein).
The need for fast approximation algorithms for estimating diameters, radii,
centrality indices, or all pairs shortest paths in large-scale complex networks
dictates to look for geometric and topological properties of those networks and
utilize them algorithmically. The classical relationships between the diameter,
radius, and center of trees and folklore linear time algorithms for their compu-
tation is one of the departing points of this research. A result from 1869 by C.
Jordan [31] asserts that the radius of a tree T is roughly equal to half of its
diameter and the center is either the middle vertex or the middle edge of any
diametral path. The diameter and a diametral pair of T can be computed (in
linear time) by a simple but elegant procedure: pick any vertex x, find any vertex
y furthest from x, and find once more a vertex z furthest from y; then return
{y, z} as a diametral pair. One computation of a furthest vertex is called an FP
scan; hence the diameter of a tree can be computed via two FP scans. This two
FP scans procedure can be extended to exact or approximate computation of
the diameter and radius in many classes of tree-like graphs. For example, this
approach was used to compute the radius and a central vertex of a chordal graph
in linear time [12]. In this case, the center of G is still close to the middle of all
(y, z)-shortest paths and dG (y, z) is not the diameter but is still its good approx-
imation: d(y, z) ≥ diam(G) − 2. Even better, the diameter of any chordal graph
can be approximated in linear time with an additive error 1 [25]. But it turns
out that the exact computation of diameters of chordal graphs is as difficult as
the general diameter problem: it is even difficult to decide if the diameter of a
split graph is 2 or 3.
The experience with chordal graphs shows that one have to abandon
the hope of having fast exact algorithms, even for very simple (from metric
point of view) graph-classes, and to search for fast algorithms approximating
diam(G), rad(G), C(G), eccG (v) with a small additive constant depending only
of the coarse geometry of the graph. Gromov hyperbolicity or the negative cur-
vature of a graph (and, more generally, of a metric space) is one such constant.
A graph G = (V, E) is δ-hyperbolic [9,27,28] if for any four vertices w, v, x, y of
G, the two largest of the three distance sums d(w, v) + d(x, y), d(w, x) + d(v, y),
d(w, y) + d(v, x) differ by at most 2δ ≥ 0. The hyperbolicity δ(G) of a graph
G is the smallest number δ such that G is δ-hyperbolic. The hyperbolicity can
be viewed as a local measure of how close a graph is metrically to a tree: the
smaller the hyperbolicity is, the closer its metric is to a tree-metric (trees are
0-hyperbolic and chordal graphs are 1-hyperbolic).
Recent empirical studies showed that many real-world graphs (including
Internet application networks, web networks, collaboration networks, social net-
works, biological networks, and others) are tree-like from a metric point of view
[3] or have small hyperbolicity [33,37]. It has been suggested in [33], and recently
formally proved in [17], that the property, observed in real-world networks, in
which traffic between nodes tends to go through a relatively small core of the
network, as if the shortest paths between them are curved inwards, is due to the
6 V. Chepoi et al.
2 Preliminaries
y y
ϕ
≤δ
mz mx
m
≤δ ≤δ
my
x z x z
Fig. 1. A geodesic triangle Δ(x, y, z), the points mx , my , mz , and the tripod Υ (x, y, z)
The Hitting Set Conjecture: There is no > 0 such that for all c ≥ 1, there is
an algorithm that given two lists A, B of n subsets of a universe U of size c log n,
can decide in O(n2−e ) time if there is a set in the first list that intersects every
set in the second list.
Abboud et al. [1] showed that an algorithm that can distinguish between
radius 2 and 3 in a sparse graph in subquadratic time refutes the Hitting Set
Conjecture. Since all geodesic triangles of a graph constructed in [1] are 2-thin,
rephrasing that result from [1], we have.
(a) If c∗ is the middle point of any (u, v)-geodesic, then eccG (c∗ ) ≤ dG (u,v)
2 +δ ≤
rad(G) + δ.
(b) If c is a middle vertex of any (u, v)-geodesic, then eccG (c) ≤ dG (u,v)
2 +δ ≤
rad(G) + δ.
(c) dG (u, v) ≥ 2rad(G) − 2δ − 1. In particular, diam(G) ≥ 2rad(G) − 2δ − 1.
(d) If c is a middle vertex of any (u, v)-geodesic and x ∈ C k (G), then k − δ ≤
dG (x, c) ≤ k + 2δ + 1. In particular, C(G) ⊆ B(c, 2δ + 1).
Proof. Let x be any vertex of G and Δ(u, v, x) := [u, v]∪[v, x]∪[x, u] be a geodesic
triangle, where [x, v], [x, u] are arbitrary geodesics connecting x with v, u. Let
mx be a point on [u, v] at distance (x|u)v = 12 (d(x, v) + d(v, u) − d(x, u)) from
v and at distance (x|v)u = 12 (d(x, u) + d(v, u) − d(x, v)) from u. Since u and
Fast Approximation of Centrality and Distances in Hyperbolic Graphs 11
(a) By the triangle inequality and since dG (u, v) ≤ diam(G) ≤ 2rad(G), we get
dG (x, c∗ ) ≤ (u|v)x + δ + dG (u, c∗ ) − (x|v)u ≤ dG (u, c∗ ) + δ = dG (u,v)
2 +δ ≤
rad(G) + δ.
(b) Since c∗ = c when dG (u, v) is even and dG (c∗ , c) = 12 when dG (u, v) is odd, we
have eccG (c) ≤ eccG (c∗ ) + 12 . Additionally to the proof of (a), one needs only
to consider the case when dG (u, v) is odd. We know that the middle point c∗
sees all vertices of G within distance at most dG (u,v) 2 + δ. Hence, both ends
of the edge of (u, v)-geodesic, containing the point c∗ , have eccentricities at
most dG (u,v)
2 + 12 + δ = dG (u,v)
2 + δ ≤ 2rad(G)−1
2 + δ = rad(G) + δ.
(c) Since a middle vertex c of any (u, v)-geodesic sees all vertices of G within
distance at most dG (u,v)2 +δ, if dG (u, v) ≤ 2rad(G)−2δ −2, then eccG (c) ≤
dG (u,v) 2rad(G)−2δ−2
2 + δ ≤ 2 + δ < rad(G), which is impossible.
(d) In the proof of (a), instead of any vertex x of G, consider any vertex x from
C k (G). By the triangle inequality and since dG (u, v) ≥ 2rad(G) − 2δ − 1 and
both dG (u, x), dG (x, v) are at most rad(G) + k, we get dG (x, c∗ ) ≤ (u|v)x +
δ + (x|u)v − dG (v, c∗ ) = dG (v, x) − dG (v, c∗ ) + δ ≤ rad(G) + k − dG (u,v)
2 +δ ≤
k + 2δ + 12 . Consequently, dG (x, c) ≤ dG (x, c∗ ) + 12 ≤ k + 2δ + 1. On the other
hand, since eccG (x) ≤ eccG (c) + dG (x, c) and eccG (c) ≤ rad(G) + δ, by (a)
we get dG (x, c) ≥ eccG (x) − eccG (c) = k + rad(G) − eccG (c) ≥ k − δ.
It is interesting to note that the equality eccG (x) = dG (x, C(G)) + rad(G)
holds for every vertex of a graph G if and only if the eccentricity function eccG (·)
on G is unimodal (that is, every local minimum is a global minimum)[22]. A
slightly weaker condition holds for all chordal graphs [24]: for every vertex x of
a chordal graph G, eccG (x) ≥ dG (x, C(G)) + rad(G) − 1. Proofs of the following
two propositions can be found in the full version of the paper [15].
Diameter and Radius. For any graph G = (V, E) and any vertex u ∈ V , a
most distant from u vertex v ∈ F (u) can be found in linear (O(|E|)) time by a
breadth-first-search BF S(u) started at u. A pair of mutually distant vertices of
a connected graph G = (V, E) with δ-thin triangles can be computed in O(δ|E|)
total time as follows. By Proposition 3(c), if v is a most distant vertex from
u and t is a most distant vertex from v, then d(v, t) ≥ diam(G) − 2δ. Hence,
using at most O(δ) breadth-first-searches, one can generate a sequence of vertices
v := v1 , t := v2 , v3 , . . . vk with k ≤ 2δ + 2 such that each vi is most distant from
vi−1 (with, v0 = u) and vk , vk−1 are mutually distant vertices (the initial value
d(v, t) ≥ diam(G) − 2δ can be improved at most 2δ times). By Proposition 2
and Proposition 3, we get the following additive approximations for the radius
and the diameter of a graph with δ-thin triangles.
All Eccentricities. In what follows, we will show that all vertex eccentricities
of a graph with δ-thin triangles can be also additively approximated in (almost)
linear time. It will be convenient, for the middle point m of an edge e of G, to
define a BF S(m)-tree of G; it is nothing else than a BF S(e)-tree of G rooted
at edge e.
Proof. (a) Let x be an arbitrary vertex of G and assume that eccG (x) =
rad(G) + k for some integer k ≥ 0. We know from Proposition 3(d) that
eccG (c) ≤ rad(G) + 3δ and dG (c, x) ≤ k + 3δ + 1. Since T is a BF S(c)-tree,
dG (x, c) = dT (x, c) and eccG (c) = eccT (c). Consider a vertex y in G such
that dT (x, y) = eccT (x). We have eccT (x) = dT (x, y) ≤ dT (x, c) + dT (c, y) ≤
dG (x, c) + eccT (c) = dG (x, c) + eccG (c) ≤ k + 3δ + 1 + rad(G) + 3δ =
rad(G) + k + 6δ + 1 = eccG (x) + 6δ + 1. As T is a spanning tree of G, evi-
dently, also eccG (x) ≤ eccT (x) holds.
(b) Consider an arbitrary vertex x of G and a geodesic triangle Δ(x, u, v) :=
[x, u] ∪ [u, v] ∪ [v, x], where [u, v] is a (u, v)-geodesic containing c∗ and [u, x], [v, x]
are arbitrary geodesics connecting x with u and v. Let mx be a point on [u, v]
which is at distance (x|u)v = 12 (dG (x, v) + dG (u, v) − dG (x, u)) from v and hence
at distance (x|v)u = 12 (dG (x, u) + dG (v, u) − dG (x, v)) from u. Without loss of
generality, we can assume that c∗ is located on [u, v] between v and mx . We have,
dG (x, c∗ ) ≤ (u|v)x + δ + dG (mx , c∗ ) = (u|v)x + δ + dG (u, c∗ ) − (v|x)u = (u|v)x +
δ + dG (v,u)
2 − (v|x)u , and eccG (x) ≥ dG (x, v) = (u|v)x + (u|x)v . Furthermore, by
Proposition 2(a), eccG (c∗ ) ≤ dG (v,u)2 + δ. Hence, eccT (x) − eccG (x) ≤ dT (x, c∗ ) +
eccT (c∗ ) − eccG (x) = dG (x, c∗ ) + eccG (c∗ ) − eccG (x) ≤ (u|v)x + δ + dG (v,u)2 −
dG (v,u)
(v|x)u + 2 + δ − (u|v)x − (u|x)v = 2δ + dG (v, u) − ((v|x)u + (u|x)v ) = 2δ.
Theorem 1. Every graph G = (V, E) with δ-thin triangles admits an eccen-
tricity (2δ)-approximating spanning tree constructible in O(δ|E|) time and an
eccentricity (6δ + 1)-approximating spanning tree constructible in O(|E|) time.
Theorem 1 generalizes recent results from [24,35] that chordal graphs and some
of their generalizations admit eccentricity 2-approximating spanning trees.
Note that the eccentricities of all vertices in any tree T = (V, U ) can be com-
puted in O(|V |) total time. As we noticed already, for trees the following facts are
true: (1) C(T ) consists of one or two adjacent vertices; (2) C(T ) and rad(T ) of T
can be found in linear time; (3) For any v ∈ V , eccT (v) = dT (v, C(T )) + rad(T ).
Hence, using BF S(C(T )) on T one can compute dT (v, C(T )) for all v ∈ V
in total O(|V |) time. Adding now rad(T ) to dT (v, C(T )), one gets eccT (v) for
all v ∈ V . Consequently, by Theorem 1, we get the following additive approxi-
mations for the vertex eccentricities in graphs with δ-thin triangles.
Theorem 2. Let G = (V, E) be a graph with δ-thin triangles.
(1) There is an algorithm which in total linear (O(|E|)) time outputs for every
vertex v ∈ V an estimate ê(v) of its eccentricity eccG (v) such that eccG (v) ≤
ê(v) ≤ eccG (v) + 6δ + 1.
(2) There is an algorithm which in total almost linear (O(δ|E|)) time outputs
for every vertex v ∈ V an estimate ê(v) of its eccentricity eccG (v) such that
eccG (v) ≤ ê(v) ≤ eccG (v) + 2δ.
O(|V |2 ) time. If Gδ is not known, then the distances can be additively approxi-
mated in almost quadratic time.
Our method is a generalization of an unified approach used in [23] to estimate
(or compute exactly) all pairs shortest paths in such special graph families as
k-chordal graphs, chordal graphs, AT-free graphs and many others. For example:
all distances in k-chordal graphs with an additive one-sided error of at most k −1
can be found in O(|V |2 ) time; all distances in chordal graphs with an additive
one-sided error of at most 1 can be found in O(|V |2 ) time and the all pairs
shortest path problem on a chordal graph G can be solved in O(|V |2 ) time if G2
is known. Note that in chordal graph all geodesic triangles are 2-thin.
Let G = (V, E) be a graph with δ-thin triangles. Pick an arbitrary start
vertex s ∈ V and construct a BF S(s)-tree T of G rooted at s. Denote by pT (x)
the parent and by hT (x) = dT (x, s) = dG (x, s) the height of a vertex x in T .
Since we will deal only with one tree T , we will often omit the subscript T . Let
PT (x, s) := (xq , xq−1 , . . . , x1 , s) and PT (y, s) := (yp , yp−1 , . . . , y1 , s) be the paths
of T connecting vertices x and y with the root s. By slT (x, y; λ) we denote the
largest index k such that dG (xk , yk ) ≤ λ (the λ separation level). Our method
is based on the following simple fact.
Proof. By the triangle inequality, dG (x, y) ≤ dG (x, xk )+dG (xk , yk )+dG (yk , y) =
hT (x) + hT (y) − 2k + dG (xk , yk ). Consider now an arbitrary (x, y)-geodesic [x, y]
in G. Let Δ(x, y, s) := [x, y] ∪ [x, s] ∪ [y, s] be a geodesic triangle, where [x, s] =
PT (x, s) and [y, s] = PT (y, s). Since Δ(x, y, s) is δ-thin, slT (x, y; δ) ≥ (x|y)s − 12 .
Hence, hT (x) − slT (x, y; δ) ≤ (s|y)x + 12 and hT (y) − slT (x, y; δ) ≤ (s|x)y + 12 .
As dG (x, y) = (s|y)x + (s|x)y , we get dG (x, y) ≥ hT (x) − slT (x, y; δ) + hT (y) −
slT (x, y; δ) − 1.
To avoid the requirement that Gδ is given in advance, we can use any known
fast constant-factor approximation algorithm that in total T (|V |)-time computes
y) such that dG (x, y) ≤ d(x,
for every pair of vertices x, y of G a value d(x, y) ≤
αdG (x, y)+β. We can show that, using such an algorithm as a preprocessing step,
the distances in a graph G with δ-thin triangles can be additively approximated
with an additive one-sided error of at most αδ + β + 1 in O(T (|V |) + |V |2 ) time.
Although one can use any known fast constant-factor approximation algorithm
in the preprocessing step, in what follows, we will demonstrate our idea using a
fast approximation algorithm from [5]. It computes in O(|V |2 log2 |V |) total time
y) such that dG (x, y) ≤ d(x,
for every pair x, y a value d(x, y) ≤ 2dG (x, y) + 1.
Assume that the values d(x, y), x, y ∈ V , are precomputed. By sl T (x, y; λ) we
denote now the largest index k such that dG (xk , yk ) ≤ λ. We have.
Proof of this propositions can be found in the full version of the paper [15].
Let ρ be any integer greater than or equal to δ. By replacing in our earlier
procedure lines (06) and (08) with
(06) xk ) ≤ 2ρ + 1 then
if d(u,
(08) v) := h(x) + h(v) − 2k + 2ρ + 1 and remove Su from F
set d(x,
16 V. Chepoi et al.
we will compute for each current vertex x all values d(x, y) := hT (x) + hT (y) −
2slT (x, y; 2ρ+1)+2ρ+1, y > x, in O(|V |) total time. By Proposition 7, dG (x, y) ≤
T (x, y; 2ρ + 1) + dG (xk , yk ) ≤ hT (x) + hT (y) − 2sl
hT (x) + hT (y) − 2sl T (x, y; 2ρ +
k , yk ) ≤ hT (x) + hT (y) − 2sl
1) + d(x T (x, y; 2ρ + 1) + 2ρ + 1 = d(x, y) and
d(x, y) = hT (x) + hT (y) − 2slT (x, y; 2ρ + 1) + 2ρ + 1 ≤ dG (x, y) + 2ρ + 2. Thus,
we have the following result:
Acknowledgements. The research of V.C., M.H., and Y.V. was supported by ANR
project DISTANCIA (ANR-17-CE40-0015).
References
1. Abboud, A., Wang, J., Vassilevska Williams, V.: Approximation and fixed param-
eter subquadratic algorithms for radius and diameter in sparse graphs. In: SODA
(2016)
2. Abboud, A., Grandoni, F., Vassilevska Williams, V.: Subcubic equivalences
between graph centrality problems, APSP and diameter. In: SODA, pp. 1681–1697
(2015)
3. Abu-Ata, M., Dragan, F.F.: Metric tree-like structures in real-world networks: an
empirical study. Networks 67, 49–68 (2016)
4. Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter
and shortest paths (w/o matrix multiplication). SIAM J. Comput. 28, 1167–81
(1999)
5. Berman, P., Kasiviswanathan, S.P.: Faster approximation of distances in graphs.
In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 541–
552. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73951-7 47
6. Borassi, M., Crescenzi, P., Habib, M.: Into the square - on the complexity of
quadratic-time solvable problems. Electron. Notes Theor. Comput. Sci. 322, 51–67
(2016)
7. Brandstädt, A., Chepoi, V., Dragan, F.F.: The algorithmic use of hypertree struc-
ture and maximum neighbourhood orderings. Discrete Appl. Math. 82, 43–77
(1998)
Fast Approximation of Centrality and Distances in Hyperbolic Graphs 17
8. Brandstädt, A., Chepoi, V., Dragan, F.F.: Distance approximating trees for chordal
and dually chordal graphs. J. Algorithms 30, 166–184 (1999)
9. Bridson, M.R., Haefiger, A.: Metric Spaces of Non-Positive Curvature, Grundlehren
der Mathematischen Wissenschaften. vol. 319, Springer (1999). https://doi.org/10.
1007/978-3-662-12494-9
10. Chechik, S., Larkin, D., Roditty, L., Schoenebeck, G., Tarjan, R.E.: and Williams,
V.V.: Better approximation algorithms for the graph diameter. In: SODA (2014)
11. Chalopin, J., Chepoi, V., Dragan, F.F., Ducoffe, G., Mohammed, A., Vaxès, Y.:
Fast approximation and exact computation of negative curvature parameters of
graphs. In: SoCG (2018)
12. Chepoi, V., Dragan, F.: A linear-time algorithm for finding a central vertex of a
chordal graph. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 159–170.
Springer, Heidelberg (1994). https://doi.org/10.1007/BFb0049406
13. Chepoi, V.D., Dragan, F.F., Estellon, B., Habib, M., Vaxès, Y.: Diameters, centers,
and approximating trees of δ-hyperbolic geodesic spaces and graphs. In: SoCG
(2008)
14. Chepoi, V., Dragan, F.F., Estellon, B., Habib, M., Vaxès, Y., Xiang, Y.: Additive
spanners and distance and routing schemes for hyperbolic graphs. Algorithmica
62, 713–732 (2012)
15. Chepoi, V., Dragan, F.F., Habib, M., Vaxès, Y., Al-Rasheed, H.: Fast approxima-
tion of centrality and distances in hyperbolic graphs. arXiv:1805.07232 (2018)
16. Chepoi, V., Dragan, F.F., Vaxès, Y.: Center and diameter problems in plane tri-
angulations and quadrangulations. In: SODA, pp. 346–355 (2002)
17. Chepoi, V., Dragan, F.F., Vaxès, Y.: Core congestion is inherent in hyperbolic
networks. In: SODA, pp. 2264–2279 (2017)
18. Chepoi, V., Estellon, B.: Packing and covering δ-hyperbolic spaces by balls. In:
Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX/RANDOM
-2007. LNCS, vol. 4627, pp. 59–73. Springer, Heidelberg (2007). https://doi.org/
10.1007/978-3-540-74208-1 5
19. Corneil, D.G., Dragan, F.F., Köhler, E.: On the power of BFS to determine a
graph’s diameter. Networks 42, 209–222 (2003)
20. Dor, D., Halperin, S., Zwick, U.: All-pairs almost shortest paths. SIAM J. Comput.
29, 1740–1759 (2000)
21. Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter.
Discr. Math. 307, 208–229 (2007)
22. Dragan, F.F.: Centers of graphs and the Helly property (in Russian), Ph.D. thesis,
Moldova State University (1989)
23. Dragan, F.F.: Estimating all pairs shortest paths in restricted graph families: a
unified approach. J. Algorithms 57, 1–21 (2005)
24. Dragan, F.F., Köhler, E., Alrasheed, H.: Eccentricity approximating trees. Discrete
Appl. Math. 232, 142–156 (2017)
25. Dragan, F.F., Nicolai, F., Brandstädt, A.: LexBFS-orderings and powers of graphs.
In: d’Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds.) WG 1996. LNCS,
vol. 1197, pp. 166–180. Springer, Heidelberg (1997). https://doi.org/10.1007/3-
540-62559-3 15
26. Edwards, K., Kennedy, W.S., Saniee, I.: Fast approximation algorithms for
p-centres in large delta-hyperbolic graphs, CoRR, vol. abs/1604.07359 (2016)
27. Ghys, E., de la Harpe, P. (eds.) Les groupes hyperboliques d’après Gromov, M.
Progress in Mathematics, Vol. 83 Birkhäuser (1990)
Another random document with
no related content on Scribd:
Ampio cappuccio gli ricade sulla fronte, interamente celandogli la
faccia, se non che trasforato in due parti lascia libero vibrare lo
sguardo. Impugna colla destra una spada che tien sollevata in atto
imperante, minaccioso.
Ad un di lui cenno, mortale grandine di dardi e di sassi piomba sugli
attoniti guerrieri. Scossi questi e furenti pei colpi che li flagellano,
non badando a periglio, entrano nelle spumose acque del torrente e
lo varcano, trovando però non pochi ne’ suoi gorghi la morte.
Pervenuti al di là, svaginati gli acciari, s’arrampicano su pei greppi e
le rupi onde raggiungere e punire gli audaci feritori. Ma ad un nuovo
segno del loro misterioso condottiero, gli alpigiani, che di semplici
panni coverti mai sostenere potevano la pugna da vicino con nimici
tutti irti e lucenti di ferro, guadagnano le alture e spariscono.
I Sanguigni dopo tal fatto tennero tra essi consiglio; alcuni opinarono
doversi far ritorno; ma i più, inanimiti dalle parole dell’intrepido
Ubaldo, ripeterono il voto di dar compimento all’impresa e
procedettero arditi, benchè più cauti, nell’interno della valle.
Non sempre lucente splendette l’estivo raggio. Si viddero a mezzo il
dì passare di prospetto frettolose le nubi, ed accavallarsi poscia sulle
erette e nude cime delle torreggianti montagne. Vaste volute salirono
a coprire la faccia del sole: cominciò a fremere il vento e sorse indi a
poco il soffio delle propinque ghiacciaje, che rimescolando quelle
masse di nebbia, abbassavale talora sino al fondo della valle.
Camminano i guerrieri taciturni in ordinanza lungo i margini scoscesi
della Sesia che rumoreggia più cupa. Ma avanzatisi di poco, freccie
e pietre scendono a furia dall’alto e molti gravemente ne percuotono
per gli elmi e le corazze. Vano è per essi alzare gli scudi e dar di
piglio alle spade: invisibile è il nemico.
Squarciasi però ad un tratto il vaporoso velo e mirano sull’irradiato
fianco del monte la schiera formidabile del camuffato Monaco che
stende ver loro la punta del ferro e li fa segno agli incessanti colpi.
Trascorsi brevi momenti si ricongiungono e frammischiano le rotte
nubi e tutto s’invola di nuovo alla vista.
Uno sgomento s’impossessa dell’animo dei guerrieri che vorrebbero
arretrare, ma imperterrito Ubaldo fa sacramento di muovere da solo
al castello se i suoi sono sì vigliacchi da abbandonarlo. Nessuno più
ardisce mostrarsi restìo e riprendono più spediti il viaggio.
Continuamente or da destra or da manca essi vengono saettati, e
sempre al sollevarsi delle nebbie scorgono il Monaco colle sue
bande che sul pendìo dei monti laterali procede a pari passo con
essi.
Raggiunta finalmente è la meta, chè tocco hanno il confine della
valle. Le montagne di fianco divergono allargandosi in anfiteatro
chiuso in fondo dal Rosa che innalza al cielo i suoi candidi gioghi. Al
principiare dell’erta sorge un quadrato castello che va agli angoli ed
al centro munito di rotonde torri colle acute piramidali sommità
vestite di piombo. Ne bagna un lato la nascente Sesia e dietro è
cinto da una selva di larici i cui rami frangiati in verdebruno stanno
vergenti al suolo. È il castello de’ Boniprandi.
Finiva il giorno; eransi dissipate le nebbie, taceva il vento. Quasi si
fosse sciolto nell’aure o l’avessero inghiottito le rupi, il Monaco fatale
era scomparso con tutti i suoi e completa ivi regnava la solitudine.
Gli ultimi fuochi del sole, abbandonato il rimanente della terra,
splendevano ancora sulle nevi dell’alpe e lo pingevano di quel colore
soave che gli fe’ prendere il nome dal più vago de’ fiori.
Condusse Ubaldo i guerrieri e li collocò a conveniente distanza
intorno al castello la cui ferrata porta era serrata saldamente; benchè
non si scorgesse per le mura o sulle torri traccia di sentinella o
d’abitante.
Furono alzate le tende; s’accesero ampie cataste, e molti militi
raccolti nel bosco de’ larici trascelsero gli alberi che venir dovevano il
mattino atterrati onde formare le macchine murali. Inoltratasi la notte,
poste che furono le scolte di spazio in ispazio, posarono i guerrieri
presso i fuochi che s’andavano spegnendo, e giacquero nel sonno.
Quando venne l’ora che salita la luna sopra le più alte vette mandò
obbliquo dai nereggianti monti l’argenteo raggio al fondo della valle,
e biancheggiarono le merlate muraglie, splendettero i plumbei
culmini delle torri, l’audace Ubaldo, cui agitava il desìo di penetrare
l’arcano di che pareva cinto quel castello, volle mirarlo vicino mentre
tutto era silenzio. Colà quindi s’avvia a lenti passi, quand’ecco al suo
appressarsi sorgere sulle mura il Monaco tremendo.
Arretra Ubaldo d’un passo, ma poi quasi da malìa incatenato si
ferma, fiso tenendo lo sguardo a contemplarlo. Terribile allora non
era quanto misterioso il di lui aspetto; le fosche lane che
ricoprivamo, fatte men rudi dalla pallida notturna luce, segnavano
perfetti contorni e parevano l’involucro d’un genio in umane forme.
Immobile rimaneva in mesto e fiero atteggiamento.
Ubaldo sbandita prestamente ogni apprensione, alzata la destra con
voce ferma, esclamò: «Invano, chiunque tu sii, ti ostini a difendere
queste mura: esse hanno ricettato l’iniquo nostro nemico e debbono
cadere. Cedi ai valorosi Sanguigni; cedi e risparmia la vita dei tuoi»
— Giammai — fu l’unica parola che dalle labbra del Monaco
pronunciare s’intese.
Due giorni dopo ogni cosa trovossi in pronto per l’assalto. Le mura
del castello difese da risoluti alpigiani non offrirono agevole
conquisto ai guerrieri d’Ubaldo. Il combattimento fu lungo,
sanguinosissimo. Il Monaco presente per tutto infiammava il
coraggio dei vassalli di Guido che tenevano con eroiche prove
lontani gli assalitori. Ma dai cozzi tremendi d’un ferreo ariete
sconquassata va a terra la porta e i guerrieri si scagliano precipitosi
per entro, nel tempo stesso che superato il muro in più parti altri
padroneggiano il vallo. Si pugna pei portici e nel cortile. Ubaldo che
all’entrare erasi scontrato nel Monaco, nella folla lo perdette di vista.
Ansioso di rinvenirlo ascese le scale seguìto dai più fidi, e lo scorse
all’ingresso della sala d’armi circondato dai pochi tra suoi
sopravvissuti. Questi vengono tosto atterrati dai guerrieri e le spade
del Monaco e d’Ubaldo s’incrocicchiano e si ribattono. Ma sia
lassezza o riportate ferite debole è il braccio del Monaco che
l’avversario incalza vigorosamente. Si va desso ritraendo,
difendendosi, sin che urta in una porta che si spalanca, e nel punto
stesso Ubaldo d’un colpo furioso lo trapassa col ferro. Dà un grido,
vacilla e abbandonata la spada cade ai piedi d’un letto su cui giace
un cadavere.
Commosso e inorridito Ubaldo impone agli accorsi guerrieri di
porgere ogni aita al languente. Vien egli tosto rialzato, gli si
sciolgono le lane, si rigetta dalla fronte il cappuccio, e... oh vista!...
un volume di treccie scende lungo il candido collo sulla maglia
d’acciajo... È la contessa Adelberta! Riapre gli occhi, si sforza a
sollevarsi, e si trascina verso le coltri, ove ricadendo spira sopra la
salma dello sposo, che sottratto vivente alle acque del fiume, venne
dai fidi vassalli portato al suo castello in cui dalla ferita morì.
Ai Sanguigni fece poscia pagar cara quella vittoria il Torniello, che
scampato di là seppe ottenere da Napo Torriano protezione ed
armati.
FINE.
MACARUFFO VENTURIERO
O LA CORTE DEL DUCA FILIPPO MARIA VISCONTI