Pages that link to "Item:Q6058195"

The following pages link to Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195):

Displaying 2 items.

• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)