Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Georgiadis, Loukas, Kipouridis, Evangelos, Kosinas, Evangelos, Papadopoulos, Charis, Parotsidis, Nikos
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2604.27474