Abdullahi, SD, Dyer, ME and Proll, LG (2003) Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems. In: Calude, CS, Dinneen, MJ and Vajnovszki, V, (eds.) Discrete Mathematics and Theoretical Computer Science. 4th International Conference, DMTCS 2003, 07-12 Jul 2003, Dijon, France. Lecture Notes in Computer Science (2731). Springer-Verlag , Berlin, Germany , pp. 89-96. ISBN 978-3-540-40505-4
Abstract
We present an O(nv) Basis Oriented Pivoting (BOP) algorithm for enumerating vertices of simple polyhedra associated with dual LI(2) systems. The algorithm is based on a characterisation of their graphical basis structures, whose set of edges are shown to consist of vertex-disjoint components that are either a tree or a subgraph with only one cycle. The algorithm generates vertices via operations on the basis graph, rather than by simplex transformations.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2003 Springer-Verlag Berlin Heidelberg. This is an author produced version of a paper published in Lecture Notes in Computer Science. The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-45066-1. Uploaded in accordance with the publisher's self-archiving policy. |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 14 Jul 2016 14:45 |
Last Modified: | 28 Feb 2024 09:15 |
Published Version: | http://dx.doi.org/10.1007/3-540-45066-1_6 |
Status: | Published |
Publisher: | Springer-Verlag |
Series Name: | Lecture Notes in Computer Science |
Identification Number: | 10.1007/3-540-45066-1_6 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:92940 |