Reverse search for enumeration (Q1917258): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): journals/dam/AvisF96, #quickstatements; #temporary_batch_1731483406851
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VertexEnumeration / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PWTri / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4188659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A basis enumeration algorithm for linear systems with geometric applications / 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: Partition of Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial face enumeration in arrangements and oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the number of \(k\)-faces in arrangements of hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structured program to generate all topological sorting arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible algorithm for generating all the spanning trees in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Linear Extensions Fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dam/AvisF96 / rank
 
Normal rank

Latest revision as of 08:57, 13 November 2024

scientific article
Language Label Description Also known as
English
Reverse search for enumeration
scientific article

    Statements

    Reverse search for enumeration (English)
    0 references
    0 references
    0 references
    13 January 1997
    0 references
    reverse search technique
    0 references
    0 references
    0 references
    0 references

    Identifiers