Making Bidirected Graphs Strongly Connected

The problem of making a given directed graph strongly connected was well-investigated by Eswaran and Tarjan (SIAM J Comput 5:653–665,  1976 ). In contrast, the problem of making a given bidirected graph strongly connected has not yet been formulated. In this paper, we consider two related problems:...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica 2020-04, Vol.82 (4), p.787-807
Hauptverfasser:	Matsuoka, Tatsuya, Sato, Shun
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Lower bounds Mathematics of Computing Theory of Computation Traveling salesman problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!