Learning hypertrees from shortest path queries

MaRDI QIDQ7017098zbMATH OpenFDO

Authors Shaun M. Fallat, Valerii Maliuk, Seyed Ahmad Mojallal, Sandra Zilles

Publication date 6 March 2025

Full work available at URL https://proceedings.mlr.press/v237/fallat24a.html

zbMATH Keywords

graph learninghypergraphhypertreeshortest path query

Mathematics Subject Classification ID

Hypergraphs (05C65) Computational learning theory (68Q32)

Cites work

• An optimal algorithm to reconstruct trees from additive distance data
• Error-tolerant non-adaptive learning of a hidden hypergraph
• Graph reconstruction via distance oracles
• Graph reconstruction with a betweenness oracle
• Graph verification with a betweenness oracle
• scientific article; zbMATH DE number 5957397 (Why is no real title available?)
• scientific article; zbMATH DE number 3485819 (Why is no real title available?)
• scientific article; zbMATH DE number 2079368 (Why is no real title available?)
• Hypergraph theory. An introduction
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Learning a Hidden Matching
• Learning a Hidden Subgraph
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• Near-linear query complexity for graph inference
• Network Discovery and Verification with Distance Queries
• Non-adaptive learning of a hidden hypergraph

This page was built for publication: Learning hypertrees from shortest path queries

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