Metrization of D_E[0,1] by Hausdorff distance between graphs
From MaRDI portal
Publication:3971746
DOI10.4064/AP-51-1-195-203zbMATH Open0736.54007OpenAlexW831252737MaRDI QIDQ3971746FDOQ3971746
Authors: Jan Kisyński
Publication date: 25 June 1992
Published in: Annales Polonici Mathematici (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/ap-51-1-195-203
Recommendations
- Measuring closeness of graphs -- the Hausdorff distance
- Metric dimension and \(R\)-sets of connected graphs
- Uniform approximation of metrics by graphs
- On {ℓ}-Metric Dimensions in Graphs
- On the Hausdorff Dimension of Some Graphs
- Hausdorff and Wasserstein metrics on graphs and other structured data
- Distance graphs on \(\mathbb R^n\) with 1-norm
- The Hausdorff Dimension of Graphs of Density Continuous Functions
- On the connected metric dimension of graphs and their complements
- Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
Cited In (6)
- Title not available (Why is that?)
- Solutions to hybrid inclusions via set and graphical convergence with stability theory applications
- A metric space of discontinuous functions on the plane
- A $D_E[0,1]$ representation of random upper semicontinuous functions
- On the completion of Skorokhod space
- Epsilon-Tubes and Generalized Skorokhod Metrics for Hybrid Paths Spaces
This page was built for publication: Metrization of D_E[0,1] by Hausdorff distance between graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971746)