tree spanners for bipartite graphs and probe interval graphs andreas brandstädt 1, feodor dragan 2,...
TRANSCRIPT
![Page 1: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/1.jpg)
Tree Spanners for Bipartite Graphs and
Probe Interval Graphs
Andreas Brandstädt1, Feodor Dragan2, Oanh Le1, Van Bang Le1, and Ryuhei Ueha
ra3
1 Universität Rostock
2 Kent State University
3 Komazawa University
![Page 2: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/2.jpg)
Tree Spanners for Bipartite Graphs and
Probe Interval Graphs
Andreas Brandstädt1, Feodor Dragan2, Oanh Le1, Van Bang Le1, and Ryuhei Ueha
ra3
1 Universität Rostock
2 Kent State University
3 Komazawa University
![Page 3: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/3.jpg)
Tree Spanner
Spanning tree T is a tree t-spanner iff
dT (x,y) ≦t dG (x,y)
for all x and y in V.
G T
xy
xy
![Page 4: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/4.jpg)
Tree Spanner
Spanning tree T is a tree t-spanner iff
G T
dT (x,y) ≦ t dG (x,y)for all {x,y} in E.
![Page 5: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/5.jpg)
Tree Spanner
Spanning tree T is a tree 6-spanner.
G T
![Page 6: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/6.jpg)
Tree Spanner
G admits a tree 4-spanner (which is optimal). Tree t-spanner problem asks
if G admits a tree t-spanner for given t.
G T
![Page 7: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/7.jpg)
Applications in distributed systems and communication networks
synchronizers in parallel systems topology for message routing
there is a very good algorithm for routing in trees
in biology evolutionary tree reconstruction
in approximation algorithms approximating the bandwidth of graphs
Any problem related to distances can be solved approximately on a complex graph if it admits a good tree spanner
G
7-spanner for G
![Page 8: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/8.jpg)
Known Results for tree t -spanner general graphs [Cai&Corneil’95]
a linear time algorithm for t =2 (t=1 is trivial) tree t -spanner is NP-complete for any t 4≧ ( NP-completeness of ⇒ bipartite graphs for t 5)≧ tree t -spanner is Open for t=3
![Page 9: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/9.jpg)
Known Results for tree t -spanner chordal graphs [Brandstädt, Dragan, Le & Le ’02]
tree t -spanner is NP-complete for any t 4≧ tree 3-spanner admissible graphs [a Number of Authors]
cographs, complements of bipartite graphs, interval graphs, directed path graphs, split graphs, permutation graphs, convex bipartite graphs, regular bipartite graphs, distance-hereditary graphs
tree 4-spanner admissible graphs AT-free graphs [PKLMW’99], strongly chordal graphs, dually chordal graphs [BCD’99]
tree 3 -spanner is in P for planar graphs [FK’2001]
![Page 10: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/10.jpg)
Known Results for tree t -spanner chordal graphs [Brandstädt, Dragan, Le & Le ’02]
tree t -spanner is NP-complete for any t 4≧ tree 3-spanner admissible graphs [a Number of Authors]
cographs, complements of bipartite graphs, interval graphs, directed path graphs, split graphs, permutation graphs, convex bipartite graphs, regular bipartite graphs, distance-hereditary graphs
tree 4-spanner admissible graphs AT-free graphs [PKLMW’99], strongly chordal graphs, dually chordal graphs [BCD’99]
tree 3 -spanner is in P for planar graphs [FK’2001]
⇒ Bipartite Graphs??
![Page 11: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/11.jpg)
Known Results for tree t -spanner bipartite graphs [Cai&Corneil ’95] tree t -spanner is NP-complete for any t 5≧ chordal graphs [Brandstädt, Dragan, Le & Le ’02]
tree t -spanner is NP-complete for any t 4≧ tree 3-spanner admissible graphs [a Number of Authors]
cographs, complements of bipartite graphs, interval graphs, directed path graphs, split graphs, permutation graphs, convex bipartite graphs, regular bipartite graphs, distance-hereditary graphs
convex bipartite interval bigraphs ⊂ ⊂ bipartite ATE-free graphs ⊂ chordal bipartite graphs ⊂ bipartite graphs
![Page 12: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/12.jpg)
This Talk
interval
rooteddirected
path
stronglychordal
chordal
weaklychordal
chordalbipartite
intervalbigraph
convex
AT-free bipartiteATE-free
bipartite
NP-C
4-Adm.
3-Adm.
![Page 13: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/13.jpg)
This Talk
interval
rooteddirected
path
stronglychordal
chordal
weaklychordal
enhancedprobe
interval
chordalbipartite
probeinterval
intervalbigraph
convexSTS-probe
interval
AT-free bipartiteATE-free
bipartite
NP-C
4-Adm.
3-Adm.
=
![Page 14: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/14.jpg)
This Talk
interval
rooteddirected
path
stronglychordal
chordal
weaklychordal
enhancedprobe
interval
chordalbipartite
probeinterval
intervalbigraph
convexSTS-probe
interval
AT-free bipartiteATE-free
bipartite
NP-C
4-Adm.
3-Adm.
=
7-Adm.
![Page 15: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/15.jpg)
NP-hardness for chordal bipartite graphs
[Thm] For any t 5, the ≧ tree t-spanner problem is NP-complete for chordal bipartite graphs.
Reduction from 3SATMonotone
… (x, y, z) or (x, y, z)
![Page 16: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/16.jpg)
NP-hardness for chordal bipartite graphs
Reduction from 3SAT Basic gadgets
Monotone
… (x, y, z) or (x, y ,z)
S1[a,b] S2[a,b] S3[a,b]
a
a’
b
b’
a b
a’ b’
S1[a,a’]
S1[a’,b’]
S1[b,b’] S2[a,a’]
S2[a’,b’]
S2[b,b’]
a b
a’ b’
![Page 17: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/17.jpg)
NP-hardness for chordal bipartite graphs
Reduction from 3SAT Basic gadget Sk[a,b] and its spanning trees
Monotone
… (x, y, z) or (x, y ,z)
a
a’
b
b’
a
a’
b
b’a
a’
b
b’
H
with {a,b}
(2k+1)-spanner
without {a,b}
h
(2k+h)-spanner
a
a’
b
b’
without {a,b}
(2k-1)-spanner
![Page 18: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/18.jpg)
NP-hardness for chordal bipartite graphs
Reduction from 3SAT Gadget for xi
Monotone
… (x, y, z) or (x, y ,z)
q r
sp
xi xi
xixi
xi
xi1
2 m1
2 m…
…Sk-1[]
Sk[]× 2
=
=
Must be selected
![Page 19: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/19.jpg)
NP-hardness for chordal bipartite graphs
Reduction from 3SAT Gadget for Cj
Monotone
… (x, y, z) or (x, y ,z)
cj cj
djdj
Sk[]× 2=
+ -
+ -
![Page 20: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/20.jpg)
NP-hardness for chordal bipartite graphs
Reduction from 3SAT Gadget for C1=(x1,x2,x3) and C2=(x1,x2,x4)
Monotone
… (x, y, z) or (x, y ,z)
q r
sp
x1 x1
x1x11
21
2
Sk-2[]=
x2 x2
x2x21
21
2
x3 x3
x3x31
21
2
x4 x4
x4x41
21
2
c1 c1
d1d1
+ -
+ -c2 c2
d2d2
+ -
+ -
![Page 21: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/21.jpg)
Tree 3-spanner for a bipartite ATE-free graph
An ATE(Asteroidal-Triple-Edge) e1,e2,e3 [Mul97]:Any two of them there is a path from
one to the other avoids the neighborhood of the third one.
[Lamma] interval bigraphs biparti⊂te ATE-free graphs chordal bi⊂partite graphs.
e1
e3e2
![Page 22: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/22.jpg)
Tree 3-spanner for a bipartite ATE-free graph
A maximum neighbor w of u: N(N(u))=N(w)
[Lamma] Any chordal bipartite graph has a vertex with a maximum neighbor.
u w
chordal bipartite graph⇔•bipartite graph•any cycle of length at least 6 has a chord
![Page 23: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/23.jpg)
Tree 3-spanner for a bipartite ATE-free graph
G; connected bipartite ATE-free graph u; a vertex with maximum neighbor
For any connected component S induced by V \ Dk-1(u), there is w in Nk-1(u) s.t. N(w) S∩N⊇
k(u)
Su … w
![Page 24: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/24.jpg)
Tree 3-spanner for a bipartite ATE-free graph
Construction of a tree 3-spanner of G: u; a vertex with maximum neighbor
u … w
![Page 25: Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität](https://reader036.vdocuments.site/reader036/viewer/2022062714/56649d095503460f949dacbf/html5/thumbnails/25.jpg)
Conclusion and open problems• Many questions remain still open. Among them:
• Can Tree 3–Spanner be decided efficientlyon general graphs??? on chordal graphs?on chordal bipartite graphs?
•Tree t–Spanner on (enhanced) probe interval graphs for t<7?
Thank you!