Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Multidimensional Search and Its Application to Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Stable States in a NOR Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-constrained matroidal knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal ratio spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum Spanning Trees / 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: An Optimal-Time Algorithm for Slope Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / 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: On matroids and hierarchical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching among intervals and compact routing tables / 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: Efficient algorithms for a family of matroid intersection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a minimum spanning pseudoforest / 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: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster shortest-path algorithms for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / 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: Infinite subgraphs as matroid circuits / 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: Q3707420 / rank
 
Normal rank

Latest revision as of 13:16, 28 May 2024

scientific article
Language Label Description Also known as
English
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
scientific article

    Statements

    Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (English)
    0 references
    0 references
    0 references
    22 July 1998
    0 references
    0 references
    planar minimum spanning tree algorithm
    0 references
    0 references
    0 references
    0 references