Graph verification with a betweenness oracle

MaRDI QIDQ4645647zbMATH OpenFDO

Authors Mano Vikash Janardhanan

Publication date 10 January 2019

Full work available at URL http://proceedings.mlr.press/v76/janardhanan17a.html

Mathematics Subject Classification ID

Computational learning theory (68Q32) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph reconstruction with a betweenness oracle
• Graph reconstruction and verification
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• Near-linear query complexity for graph inference
• Graph reconstruction via distance oracles

Cited in

(5)

• A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
• Reconstruction and verification of chordal graphs with a distance oracle
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• Graph reconstruction with a betweenness oracle
• Learning hypertrees from shortest path queries

This page was built for publication: Graph verification with a betweenness oracle

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