Pages that link to "Item:Q3794218"

The following pages link to Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs (Q3794218):

Displayed 17 items.

• Series-parallel orientations preserving the cycle-radius (Q413267) ‎ (← links)
• The directed orienteering problem (Q547309) ‎ (← links)
• Graph connectivity and its augmentation: Applications of MA orderings (Q697579) ‎ (← links)
• Eulerian detachments with local edge-connectivity (Q1028462) ‎ (← links)
• An algorithm for an Eulerian trail traversing specified edges in given order (Q1343142) ‎ (← links)
• Splitting and contractible edges in 4-connected graphs (Q1400957) ‎ (← links)
• Splitting off edges between two subsets preserving the edge-connectivity of the graph. (Q1422410) ‎ (← links)
• Approximating the minimum tour cover of a digraph (Q1736480) ‎ (← links)
• Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (Q2392924) ‎ (← links)
• Routing in Undirected Graphs with Constant Congestion (Q2817791) ‎ (← links)
• (Q2861509) ‎ (← links)
• Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) ‎ (← links)
• Euler Digraphs (Q3120436) ‎ (← links)
• The Directed Minimum Latency Problem (Q3541796) ‎ (← links)
• A note on orientations of mixed graphs (Q5957358) ‎ (← links)
• FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) ‎ (← links)
• Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio (Q6169113) ‎ (← links)