Upper bounds for the diameter and height of graphs of convex polyhedra-Reference-Cited by-同舟云学术

Upper bounds for the diameter and height of graphs of convex polyhedra

Published:1992-12 Issue:4 Volume:8 Page:363-372
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Kalai Gil

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02293053.pdf

Reference12 articles.

1. D. W. Barnette,W v paths on 3-polytopes,J. Combin. Theory 7 (1969), 62–70.

2. D. B. Dantzig,Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.

3. A. V. Goldberg, E. Tardos, and R. E. Tarjan, Network flow algorithms, inPath, Flows and VLSI Layout, (B. Korteet al., eds.), Springer-Verlag, New York, 1990, pp. 101–164.

4. B. Grünbaum,Convex Polytopes, Wiley Interscience, London, 1967, Chapter 16.

5. G. Kalai, The diameter problem for convex polytopes andf-vector theory, inThe Victor Klee Festschrift (P. Gritzman and B. Strumfels, eds.), American Mathematical Society, Providence, RI, 1991, pp. 387–411.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Monotone Diameter of Bisubmodular Polyhedra;Operations Research Forum;2023-10-07

2. On the Length of Monotone Paths in Polyhedra;SIAM Journal on Discrete Mathematics;2021-01

3. Computing in Combinatorial Optimization;Lecture Notes in Computer Science;2019

4. Monotone Paths in Geometric Triangulations;Theory of Computing Systems;2018-02-28

5. Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count;Combinatorica;2017-02-13