scientific article; zbMATH DE number 4060740

MaRDI QIDQ3795243zbMATH OpenFDO

Authors Alessandro D'Atri, Marina Moscarini, Antonio Sassano

Publication date 1988

zbMATH Keywords

Steiner treeconcept classesBoolean formulalearnabilitynonuniform learning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Recommendations

• scientific article; zbMATH DE number 4060753
• Nonuniform learnability
• Results on learnability and the Vapnik-Chervonenkis dimension
• Learning in parallel
• Learnability with respect to fixed distributions

Cited in

(8)

• On the geodeticity of the contour of a graph
• Weighted connected domination and Steiner trees in distance-hereditary graphs
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Homogeneously orderable graphs
• scientific article; zbMATH DE number 4060753 (Why is no real title available?)
• Nonuniform learnability
• Computing a metric basis of a 2-connected bipartite distance-hereditary graph
• Homogeneous sets and domination problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795243)