𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on K -Best Solutions to the Chinese Postman Problem

✍ Scribed by Saruwatari, Yasufumi; Matsui, Tomomi

Book ID
118204850
Publisher
Society for Industrial and Applied Mathematics
Year
1993
Tongue
English
Weight
949 KB
Volume
3
Category
Article
ISSN
1052-6234

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the max-cut problem for a planar, cub
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 109 KB πŸ‘ 2 views

## Abstract Every 3‐connected planar, cubic, triangle‐free graph with __n__ vertices has a bipartite subgraph with at least 29__n__/24β€‰βˆ’β€‰7/6 edges. The constant 29/24 improves the previously best known constant 6/5 which was considered best possible because of the graph of the dodecahedron. Example

A note on the solution of the phase prob
A note on the solution of the phase problem
✍ Hauptman, H. ;Karle, J. πŸ“‚ Article πŸ“… 1954 πŸ› International Union of Crystallography 🌐 English βš– 292 KB