| Naslov: | Linear-time vertex-connectivity for graphs of bounded genus |
|---|
| Avtorji: | ID Cabello, Sergio (Avtor)
ID Dobler, Alexander (Avtor)
ID Fijavž, Gašper (Avtor)
ID Hamm, Thekla (Avtor)
ID Wagner, Mirko H. (Avtor) |
|---|
| Datoteke: |  PDF - Predstavitvena datoteka, prenos (996,31 KB)
MD5: F45A440D43180C9C15355B23AE252A85
 URL - Izvorni URL, za dostop obiščite https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2026.56
|
|---|
| Jezik: | Angleški jezik |
|---|
| Tipologija: | 1.08 - Objavljeni znanstveni prispevek na konferenci |
|---|
| Organizacija: |  IMFM - Inštitut za matematiko, fiziko in mehaniko
|
|---|
| Povzetek: | We provide a new linear-time algorithm for determining the vertex-connectivity of graphs with bounded genus. This generalizes and streamlines a linear-time algorithm for graphs with bounded crossing number which was recently obtained by Biedl, Bose and Murali [ESA 2024]. Compared to applying the even more recent fixed parameter linear-time algorithm for deciding bounded vertex-connectivity announced by Korhonen [STOC 2025] to graphs of bounded genus,our algorithm is far simpler, its correctness easier to establish, and it makes use of geometric ideas, as is natural for surface-embedded graphs. |
|---|
| Ključne besede: | vertex-connectivity, graphs on surfaces, genus of a graph |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Leto izida: | 2026 |
|---|
| Št. strani: | Str. 56:1-56:15 |
|---|
| PID: | 20.500.12556/DiRROS-32247  |
|---|
| UDK: | 004.42:519.17 |
|---|
| ISSN pri članku: | 1868-8969 |
|---|
| DOI: | 10.4230/LIPIcs.ESA.2026.56 |
|---|
| COBISS.SI-ID: | 289440515 |
|---|
| Opomba: |
|
|---|
| Datum objave v DiRROS: | 02.09.2026 |
|---|
| Število ogledov: | 16 |
|---|
| Število prenosov: | 16 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
