Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
From MaRDI portal
Publication:3794218
DOI10.1002/jgt.3190120314zbMath0649.05049OpenAlexW2167374893MaRDI QIDQ3794218
Publication date: 1988
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190120314
Related Items (17)
An algorithm for an Eulerian trail traversing specified edges in given order ⋮ Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems ⋮ FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM ⋮ Series-parallel orientations preserving the cycle-radius ⋮ Splitting and contractible edges in 4-connected graphs ⋮ Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio ⋮ Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ Splitting off edges between two subsets preserving the edge-connectivity of the graph. ⋮ The Directed Minimum Latency Problem ⋮ Approximating the minimum tour cover of a digraph ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ The directed orienteering problem ⋮ Unnamed Item ⋮ A note on orientations of mixed graphs ⋮ Routing in Undirected Graphs with Constant Congestion ⋮ Eulerian detachments with local edge-connectivity ⋮ Euler Digraphs
Cites Work
This page was built for publication: Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
