Exact learning of weighted graphs using composite queries

DOI10.1007/978-3-031-98740-3_8MaRDI QIDQ6876411zbMATH OpenFDO

Authors Michael T. Goodrich, Songyu Liu, Ioannis Panageas

Publication date 13 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-98740-3_8

zbMATH Keywords

exact learninggraph reconstructiongraph theorymachine learning

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A fast algorithm for constructing trees from distance matrices
• A simple algorithm for graph reconstruction
• Are there graphs whose shortest path structure requires large edge weights?
• Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs
• Graph connectivity and single element recovery via linear and OR queries
• Graph reconstruction and verification
• scientific article; zbMATH DE number 7651142 (Why is no real title available?)
• Interplay between topology and edge weights in real-world graphs: concepts, patterns, and an algorithm
• Learning a bounded-degree tree using separator queries
• Mapping networks via parallel kth-hop traceroute queries
• Optimally reconstructing weighted graphs using queries
• Reconstructing ultrametric trees from noisy experiments
• Structural diagnosis of wiring networks: Finding connected components of unknown subgraphs

This page was built for publication: Exact learning of weighted graphs using composite queries

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