Temporalizing Digraphs via Linear-Size Balanced Bi-Trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Temporalizing Digraphs via Linear-Size Balanced Bi-Trees

Résumé

In a directed graph D on vertex set v₁,… ,v_n, a forward arc is an arc v_iv_j where i < j. A pair v_i,v_j is forward connected if there is a directed path from v_i to v_j consisting of forward arcs. In the Forward Connected Pairs Problem (FCPP), the input is a strongly connected digraph D, and the output is the maximum number of forward connected pairs in some vertex enumeration of D. We show that FCPP is in APX, as one can efficiently enumerate the vertices of D in order to achieve a quadratic number of forward connected pairs. For this, we construct a linear size balanced bi-tree T (an out-branching and an in-branching with same size and same root which are vertex disjoint in the sense that they share no vertex apart from their common root). The existence of such a T was left as an open problem (Brunelli, Crescenzi, Viennot, Networks 2023) motivated by the study of temporal paths in temporal networks. More precisely, T can be constructed in quadratic time (in the number of vertices) and has size at least n/3. The algorithm involves a particular depth-first search tree (Left-DFS) of independent interest, and shows that every strongly connected directed graph has a balanced separator which is a circuit. Remarkably, in the request version RFCPP of FCPP, where the input is a strong digraph D and a set of requests R consisting of pairs {x_i,y_i}, there is no constant c > 0 such that one can always find an enumeration realizing c.|R| forward connected pairs {x_i,y_i} (in either direction).
Fichier principal
Vignette du fichier
LIPIcs.STACS.2024.13.pdf (662.53 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY - Paternité

Dates et versions

hal-04531675 , version 1 (04-04-2024)

Licence

Paternité

Identifiants

Citer

Stéphane Bessy, Stéphan Thomassé, Laurent Viennot. Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. STACS 2024 - 41st International Symposium on Theoretical Aspects of Computer Science, Mar 2024, Clermont-Ferrand, France. pp.13:1-13:12, ⟨10.4230/LIPIcs.STACS.2024.13⟩. ⟨hal-04531675⟩
1 Consultations
1 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More