Drawing Reeb graphs

DOI10.1007/978-3-031-98740-3_5MaRDI QIDQ6876415zbMATH OpenFDO

Authors Erin W. Chambers, Brittany Terese Fasy, Erfan Hosseini Sereshgi, Maarten Löffler

Publication date 13 January 2026

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

zbMATH Keywords

graph drawingReeb graphsminimum crossing

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1693470 (Why is no real title available?)
• scientific article; zbMATH DE number 1500676 (Why is no real title available?)
• scientific article; zbMATH DE number 3106699 (Why is no real title available?)
• A deterministic O(m m) time algorithm for the Reeb graph
• A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
• Categorified Reeb graphs
• Crossing Number is NP-Complete
• Drawing Reeb graphs
• How to draw a planar graph on a grid
• Level planarity is more difficult than we thought (poster abstract)
• On the computational complexity of upward and rectilinear planarity testing
• Reeb graphs for shape analysis and applications
• Reeb spaces of piecewise linear mappings
• Some simplified NP-complete graph problems
• Upward planarity testing

Cited in

(1)

• Drawing Reeb graphs

This page was built for publication: Drawing Reeb graphs

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