Learning graphs and 1-uniform dcsl graphs
From MaRDI portal
Recommendations
Cites work
- Characterization of 1-uniform dcsl graphs and well graded family of sets
- Distance compatible set-labeling index of graphs
- scientific article; zbMATH DE number 2068142 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Learning spaces. Interdisciplinary applied mathematics
- Note on two necessary and sufficient axioms for a well-graded knowledge space
- On verifying and engineering the wellgradedness of a union-closed family
- Partial cubes: Structures, characterizations, and constructions
- Well-graded families of relations
Cited in
(6)- Distance compactible set labeled graphs and friendship hypergraphs
- Characterization of vertex labeling of 1-uniform dcsl graph which form a lattice
- Uniform distance-compatible set-labelings of graphs
- Constructions of 1-uniform dcsl graphs using well-graded families of sets
- Characterization of 1-uniform dcsl graphs and well graded family of sets
- The one-inclusion graph algorithm is near-optimal for the prediction model of learning
This page was built for publication: Learning graphs and 1-uniform dcsl graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370819)