Comparing hypergraphs by areas of hyperedges drawn on a convex polygon

DOI10.1007/B11261zbMATH Open1179.05079OpenAlexW62175113MaRDI QIDQ5897100FDOQ5897100

Authors: Hiro Ito, Hiroshi Nagamochi 

Publication date: 5 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11261

Recommendations

• Two equivalent measures on weighted hypergraphs
• Modeling hypergraphs by graphs with the same mincut properties
• Canonical and monophonic convexities in hypergraphs
• Sum of edge lengths of a multigraph drawn on a convex polygon
• Polytopes determined by hypergraph classes

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Hypergraphs (05C65)

Cited In (2)

• Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon
• Two equivalent measures on weighted hypergraphs

This page was built for publication: Comparing hypergraphs by areas of hyperedges drawn on a convex polygon

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