FMF, Mathematical Library, Lj. (MAKLJ)
-
Minimum cuts in geometric intersection graphsCabello, Sergio ; Mulzer, WolfgangLet ▫$\mathcal{D}$▫ be a set of ▫$n$▫ disks in the plane. The disk graph ▫$G_\mathcal{D}$▫ for ▫$\mathcal{D}$▫ is the undirected graph with vertex set ▫$\mathcal{D}$▫ in which two disks are joined by ... an edge if and only if they intersect. The directed transmission graph ▫$G^{\rightarrow}_\mathcal{D}$▫ for ▫$\mathcal{D}$▫ is the directed graph with vertex set ▫$\mathcal{D}$▫ in which there is an edge from a disk ▫$D_1 \in \mathcal{D}$▫ to a disk ▫$D_2 \in \mathcal{D}$▫ if and only if ▫$D_1$▫ contains the center of ▫$D_2$▫. Given ▫$\mathcal{D}$▫ and two non-intersecting disks ▫$s, t \in \mathcal{D}$▫, we show that a minimum ▫$s$▫-▫$t$▫ vertex cut in ▫$G_\mathcal{D}$▫ or in ▫$G^{\rightarrow}_\mathcal{D}$▫ can be found in ▫$O(n^{3/2}\text{polylog} n)$▫ expected time. To obtain our result, we combine an algorithm for the maximum flow problem in general graphs with dynamic geometric data structures to manipulate the disks. As an application, we consider the barrier resilience problem in a rectangular domain. In this problem, we have a vertical strip ▫$S$▫ bounded by two vertical lines, ▫$L_\ell$▫ and ▫$L_r$▫, and a collection ▫$\mathcal{D}$▫ of disks. Let ▫$a$▫ be a point in ▫$S$▫ above all disks of ▫$\mathcal{D}$▫, and let ▫$b$▫ a point in ▫$S$▫ below all disks of ▫$\mathcal{D}$▫. The task is to find a curve from ▫$a$▫ to ▫$b$▫ that lies in ▫$S$▫ and that intersects as few disks of ▫$\mathcal{D}$▫ as possible. Using our improved algorithm for minimum cuts in disk graphs, we can solve the barrier resilience problem in ▫$O(n^{3/2}\text{polylog} n)$▫ expected time.Source: Computational geometry. - ISSN 0925-7721 (Vol. 94, March 2021, art. 101720 (9 str.))Type of material - article, component partPublish date - 2021Language - englishCOBISS.SI-ID - 38697219
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|---|
Cabello, Sergio | 25993 |
Mulzer, Wolfgang | ![]() |
Source: Personal bibliographies
and: SICRIS
Select pickup location:
Material pickup by post
Delivery address:
Address is missing from the member's data.
The address retrieval service is currently unavailable, please try again.
By clicking the "OK" button, you will confirm the pickup location selected above and complete the reservation process.
By clicking the "OK" button, you will confirm the above pickup location and delivery address, and complete the reservation process.
By clicking the "OK" button, you will confirm the address selected above and complete the reservation process.
Notification
Automatic login and reservation service currently not available. You can reserve the material on the Biblos portal or try again here later.
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
Pickup location | Material status | Reservation |
---|
Reservation in progress
Please wait a moment.
Reservation was successful.
Reservation failed.
Reservation...
Membership card:
Pickup location: