The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in \(R^n\)

DOI10.1134/S1064562416010221zbMath1339.05208MaRDI QIDQ294338

Z. N. Ovsyannikov

Publication date: 16 June 2016

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

computer calculations

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (2)

Local structure of Gromov-Hausdorff space around generic finite metric spaces ⋮ Unnamed Item

Cites Work

• Fibonacci sequences and the space of compact sets
• A missing prime configuration in the Hausdorff metric geometry
• Missing edge coverings of bipartite graphs and the geometry of the Hausdorff metric

This page was built for publication: The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in \(R^n\)