Pages that link to "Item:Q4766817"
From MaRDI portal
The following pages link to Matching, Euler tours and the Chinese postman (Q4766817):
Displaying 50 items.
- On games arising from multi-depot Chinese postman problems (Q256685) (← links)
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- Extensions to 2-factors in bipartite graphs (Q396808) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- On graphs which can or cannot induce Chinese Postman games with a non-empty core (Q442225) (← links)
- Euler index in uncertain graph (Q449488) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- My experiences as a student and researcher in OR during the 1960's and 70's (Q537599) (← links)
- On Chinese postman games where residents of each road pay the cost of their road (Q550185) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- On T-joins and odd factors (Q579278) (← links)
- Traveling salesman problem with clustering (Q616229) (← links)
- Postman tours and cycle covers (Q686511) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Ideal clutters (Q697573) (← links)
- On the most imbalanced orientation of a graph (Q721946) (← links)
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- The mixed postman problem (Q754753) (← links)
- Edge-contraction problems (Q794164) (← links)
- On the windy postman problem (Q800837) (← links)
- Shortest coverings of graphs with cycles (Q802571) (← links)
- The arc partitioning problem (Q806736) (← links)
- The robot cleans up (Q849139) (← links)
- A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading (Q850321) (← links)
- A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal (Q850322) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- Search for an immobile entity on a network (Q933506) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
- A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537) (← links)
- Polarity and the complexity of the shooting experiment (Q951126) (← links)
- On matrices with the Edmonds-Johnson property (Q972620) (← links)
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668) (← links)
- Approximation algorithm for maximum edge coloring (Q1007243) (← links)
- Distributed testing without encountering controllability and observability problems (Q1028999) (← links)
- Heuristics for the stochastic Eulerian tour problem (Q1043339) (← links)
- The fleet size and mix problem for capacitated arc routing (Q1064973) (← links)
- On negative cycles in mixed graphs (Q1071027) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
- Families of cuts with the MFMC-property (Q1082240) (← links)
- General factors of graphs (Q1085185) (← links)
- A quick proof of Seymour's theorem on t-joins (Q1089008) (← links)
- Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- Matrices with the Edmonds-Johnson property (Q1100483) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- A construction for binary matroids (Q1102297) (← links)
