arXiv Open Access 2022

Minimum strongly biconnected spanning directed subgraph problem

Raed Jaberi

Lihat Sumber

Abstrak

Let $G=(V,E)$ be a strongly biconnected directed graph. In this paper we consider the problem of computing an edge subset $H \subseteq E$ of minimum size such that the directed subgraph $(V,H)$ is strongly biconnected.

Topik & Kata Kunci

cs.DS

Penulis (1)

Raed Jaberi

Format Sitasi

APA MLA BibTeX

Jaberi, R. (2022). Minimum strongly biconnected spanning directed subgraph problem. https://arxiv.org/abs/2207.04321

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2022
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓