On some connectivity properties of Eulerian graphs
From MaRDI portal
Publication:4103563
DOI10.1007/BF01902503zbMath0337.05124MaRDI QIDQ4103563
Publication date: 1976
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Related Items
Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity, Minimum cost multiflows in undirected networks, An algorithm for an Eulerian trail traversing specified edges in given order, Path packing and a related optimization problem, On Element-Connectivity Preserving Graph Simplification, Free multiflows in bidirected and skew-symmetric graphs, Multiflows and disjoint paths of minimum total cost, The parsimonious property of cut covering problems and its applications, An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem, Minimum weight \((T,d)\)-joins and multi-joins, Multiterminal flows and cuts, Bit threads and holographic monogamy, On the fractionality of the path packing problem, Min-cost multiflows in node-capacitated undirected networks, The Generalized Terminal Backup Problem, Finding Maximum Edge-Disjoint Paths Between Multiple Terminals, The Lovász-Cherkassky theorem for locally finite graphs with ends, FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM, The Lovász-Cherkassky theorem in countable graphs, Odd Decompositions of Eulerian Graphs, Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees, Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio, A Survey on Covering Supermodular Functions, Decomposing a graph into bistars, Tree metrics and edge-disjoint \(S\)-paths, Decomposing graphs into paths of fixed length, A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem, On the Query Complexity of Testing Orientations for Being Eulerian, Strongly 2-connected orientations of graphs, Approximating the minimum tour cover of a digraph, Short proofs on multicommodity flows and cuts, Primal-dual approximation algorithms for integral flow and multicut in trees, Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time, L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem, A note on the prize collecting traveling salesman problem, Survivable networks, linear programming relaxations and the parsimonious property, Unnamed Item, A fast algorithm for the path 2-packing problem, Minimum-weight two-connected spanning networks, Über die Maximalzahl kantendisjunkter A-Wege, Orientations of infinite graphs with prescribed edge-connectivity, Lift-contractions, Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation, Holographic entanglement negativity and replica symmetry breaking, A new contraction technique with applications to congruency-constrained cuts, Minimum multiway cuts in trees, Tight spans of distances and the dual fractionality of undirected multiflow problems, Metrics with finite sets of primitive extensions, Approximation algorithms with constant ratio for general cluster routing problems, Euler Digraphs, A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem, A linear programming formulation of Mader's edge-disjoint paths problem, On multiflow lexicographics
Cites Work
