A Semiring on Convex Polygons and Zero-Sum Cycle Problems

DOI10.1137/0219061MaRDI QIDQ3495676zbMATH OpenOpenAlexFDO

Authors Kazuo Iwano, Ken Steiglitz

Publication date 1990

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0219061

zbMATH Keywords

convex hullconvex polygonsdirected graphKleene's algorithmsemiringvector summationzero-sum cycle problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Semirings (16Y60) Other problems of combinatorial convexity (52A37) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Zero-sum cycles in flexible non-triangular polyhedra
• On the Erdős-Szekeres convex polygon problem
• scientific article; zbMATH DE number 1786502
• On cardinality constrained cycle and path polytopes
• On the cycle polytope of a binary matroid
• On the areas of cyclic and semicyclic polygons
• On cycle cones and polyhedra
• On cycle cones and polyhedra
• On cycles and the stable multi-set polytope
• On the cyclic convexity of a graph

Cited in

(5)

• Topologically trivial closed walks in directed surface graphs
• Inductive semimodules and the vector modules over them.
• On the complexity of reasoning in Kleene algebra
• Topologically trivial closed walks in directed surface graphs
• scientific article; zbMATH DE number 4185647 (Why is no real title available?)

This page was built for publication: A Semiring on Convex Polygons and Zero-Sum Cycle Problems

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