Image de couverture de livre

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jaberi, Raed, Mansour, Reham
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
par: Tsin, Yung H.
Publié: (2023)

Dynamic framework for edge-connectivity maintenance of simple graphs
par: Wrobel, Blazej
Publié: (2026)

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
par: Czyżewska, Jadwiga, et autres
Publié: (2025)

Forcing a unique minimum spanning tree and a unique shortest path
par: Gima, Tatsuya, et autres
Publié: (2025)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
par: Lokshtanov, Daniel, et autres
Publié: (2026)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
par: Chudnovsky, Maria, et autres
Publié: (2024)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Fair densest subgraph across multiple graphs
par: Arachchi, Chamalee Wickrama, et autres
Publié: (2025)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
par: Hochbaum, Dorit S.
Publié: (2024)

Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
par: An, Shinwoo, et autres
Publié: (2024)

A customizable inexact subgraph matching algorithm for attributed graphs
par: Benko, Tatyana, et autres
Publié: (2025)

Interdiction of minimum spanning trees and other matroid bases
par: Weninger, Noah, et autres
Publié: (2024)

On 2-strong connectivity orientations of mixed graphs and related problems
par: Georgiadis, Loukas, et autres
Publié: (2023)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
par: Bodlaender, Hans L., et autres
Publié: (2025)

Bicriteria approximation for $k$-edge-connectivity
par: Nutov, Zeev, et autres
Publié: (2025)

Computing largest minimum color-spanning intervals of imprecise points
par: Acharyya, Ankush, et autres
Publié: (2024)

Locally computing edge orientations
par: Mitrović, Slobodan, et autres
Publié: (2025)

An $2\sqrt{k}$-approximation algorithm for minimum power $k$ edge disjoint $st$ -paths
par: Nutov, Zeev
Publié: (2022)

Improved bicriteria approximation for $k$-edge-connectivity
par: Nutov, Zeev
Publié: (2025)

On $k$-connectivity oracles in $k$-connected graphs
par: Nutov, Zeev
Publié: (2026)

QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
par: Bonnet, Édouard, et autres
Publié: (2026)

Testing whether a subgraph is convex or isometric
par: Cabello, Sergio
Publié: (2025)

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
par: Yamanaka, Toshiaki
Publié: (2025)

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs
par: Fang, Qiming, et autres
Publié: (2026)

Reconstructing edge-deleted unicyclic graphs
par: Pizzimenti, Anthony E., et autres
Publié: (2024)

Are there graphs whose shortest path structure requires large edge weights?
par: Bernstein, Aaron, et autres
Publié: (2023)

An FPRAS for two terminal reliability in directed acyclic graphs
par: Feng, Weiming, et autres
Publié: (2023)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs
par: Dumas, Maël, et autres
Publié: (2022)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
par: Xiao, Chenglong, et autres
Publié: (2024)

On the complexity of edge subdivision to $H$-free graphs
par: Piecyk, Marta, et autres
Publié: (2026)

Quasilinear-time eccentricities computation, and more, on median graphs
par: Bergé, Pierre, et autres
Publié: (2024)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
par: Tu, Sijing, et autres
Publié: (2025)

The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards
par: Bengali, Vedangi, et autres
Publié: (2025)

The trace reconstruction problem for spider graphs
par: Sun, Alec, et autres
Publié: (2022)

On the complexity of finding a spanning even tree in a graph
par: Hanaka, Tesshu, et autres
Publié: (2024)

Cover time of random subgraphs of the hypercube
par: Cooper, Colin, et autres
Publié: (2025)

Liar's vertex-edge domination in unit disk graph
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

Liar's vertex-edge domination in subclasses of chordal graphs
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width
par: Kluk, Kacper, et autres
Publié: (2025)

Approximating optimization problems in graphs with locational uncertainty
par: Bougeret, Marin, et autres
Publié: (2022)