Memory-efficient enumeration of constrained spanning trees (Q294700): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q126471184, #quickstatements; #temporary_batch_1722421251154
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating rooted triangulations without repetitions / 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: The parallel search bench ZRAM and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of spanning tree problems with leaf-dependent objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4363166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good algorithm for smallest spanning trees with a degree constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All Spanning Trees of Directed and Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note on the approximability of the maximum leaves spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Diameter Spanning Trees and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763326 / 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: EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017107072 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126471184 / rank
 
Normal rank

Latest revision as of 11:22, 31 July 2024

scientific article
Language Label Description Also known as
English
Memory-efficient enumeration of constrained spanning trees
scientific article

    Statements

    Memory-efficient enumeration of constrained spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    enumeration
    0 references
    exhaustive search
    0 references
    combinatorics
    0 references
    optimization
    0 references
    algorithms
    0 references
    output-sensitive
    0 references
    graphs
    0 references
    spanning trees
    0 references
    constraints
    0 references

    Identifiers