CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
slides
Mimicking Networks and Succinct Representations of Terminal Cuts
Authors
Robert Krauthgamer
Inbal Rika
Publication date
26 July 2012
Publisher
View
on
arXiv
Abstract
Given a large edge-weighted network
G
G
G
with
k
k
k
terminal vertices, we wish to compress it and store, using little memory, the value of the minimum cut (or equivalently, maximum flow) between every bipartition of terminals. One appealing methodology to implement a compression of
G
G
G
is to construct a \emph{mimicking network}: a small network
G
′
G'
G
′
with the same
k
k
k
terminals, in which the minimum cut value between every bipartition of terminals is the same as in
G
G
G
. This notion was introduced by Hagerup, Katajainen, Nishimura, and Ragde [JCSS '98], who proved that such
G
′
G'
G
′
of size at most
2
2
k
2^{2^k}
2
2
k
always exists. Obviously, by having access to the smaller network
G
′
G'
G
′
, certain computations involving cuts can be carried out much more efficiently. We provide several new bounds, which together narrow the previously known gap from doubly-exponential to only singly-exponential, both for planar and for general graphs. Our first and main result is that every
k
k
k
-terminal planar network admits a mimicking network
G
′
G'
G
′
of size
O
(
k
2
2
2
k
)
O(k^2 2^{2k})
O
(
k
2
2
2
k
)
, which is moreover a minor of
G
G
G
. On the other hand, some planar networks
G
G
G
require
∣
E
(
G
′
)
∣
≥
Ω
(
k
2
)
|E(G')| \ge \Omega(k^2)
∣
E
(
G
′
)
∣
≥
Ω
(
k
2
)
. For general networks, we show that certain bipartite graphs only admit mimicking networks of size
∣
V
(
G
′
)
∣
≥
2
Ω
(
k
)
|V(G')| \geq 2^{\Omega(k)}
∣
V
(
G
′
)
∣
≥
2
Ω
(
k
)
, and moreover, every data structure that stores the minimum cut value between all bipartitions of the terminals must use
2
Ω
(
k
)
2^{\Omega(k)}
2
Ω
(
k
)
machine words
Similar works
Full text
Available Versions
CiteSeerX
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:CiteSeerX.psu:10.1.1.431.2...
Last time updated on 22/10/2014