Using sparsification for parametric minimum spanning tree problems (Q5054811): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: David Fernández Baca / rank
Normal rank
 
Property / author
 
Property / author: David Fernández Baca / 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.1007/3-540-61422-2_128 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1567663444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter, width, closest line pair, and parametric searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-constrained matroidal knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal ratio spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for intersecting line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separator based sparsification for dynamic planar graph algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing Subsets with Maximum Weighted Average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parametric search on graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for parametric minimum spanning tree problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Combinatorial Computing and a Problem of Program Module Distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Classes of Two-Parameter Objectives Over Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic algorithm for the three-dimensional diameter problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal polygon containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:08, 31 July 2024

scientific article; zbMATH DE number 7631753
Language Label Description Also known as
English
Using sparsification for parametric minimum spanning tree problems
scientific article; zbMATH DE number 7631753

    Statements

    Using sparsification for parametric minimum spanning tree problems (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references