Two equivalent measures on weighted hypergraphs

DOI10.1016/j.dam.2006.04.013zbMath1108.05067OpenAlexW1998845480MaRDI QIDQ860393

Hiroshi Nagamochi, Hiro Ito

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.013

zbMATH Keywords

areapolynomial time algorithmconvex polygonsconvex three-cuts

Mathematics Subject Classification ID

Hypergraphs (05C65)

Cites Work

• Unnamed Item
• Reconstructing graphs from cut-set sizes
• Sum of edge lengths of a multigraph drawn on a convex polygon
• On circular layouts^∗
• Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon
• Discrete and Computational Geometry
• Lengths of tours and permutations on a vertex set of a convex polygon.

This page was built for publication: Two equivalent measures on weighted hypergraphs