Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (Q2482881): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Margot, François / rank
Normal rank
 
Property / author
 
Property / author: Margot, François / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0925-7721(95)00049-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150961023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding All Vertices of Convex Polyhedral Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Vertex Enumeration Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all minimum-cost perfect matchings in Bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all the perfect matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5621733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Segments in enumerating faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 21:16, 27 June 2024

scientific article
Language Label Description Also known as
English
Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
scientific article

    Statements

    Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (English)
    0 references
    0 references
    0 references
    0 references
    25 April 2008
    0 references
    vertex enumeration problem
    0 references
    face enumeration problem
    0 references
    restricted vertex problem
    0 references
    optimal vertex problems for polyhedra
    0 references
    arrangements of hyperplanes
    0 references

    Identifiers