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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q324833
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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-59175-3_94 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2690212491 / 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: 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: Finding Minimum Spanning Trees / 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: Parametric Problems 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: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / 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: 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: 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
Property / cites work
 
Property / cites work: Q2743978 / rank
 
Normal rank

Latest revision as of 22:19, 29 July 2024

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

    Statements

    Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (English)
    0 references
    0 references
    0 references
    16 August 2022
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references