Optimal parametric search on graphs of bounded tree-width (Q5056174): 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-58218-5_14 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1587940564 / 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: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of optimal subgraphs of decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for finding tree-decompositions of small treewidth / 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: 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: Parametric Problems on Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining regular properties dynamically in \(k\)-terminal graphs / 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: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate parametric searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822197 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:07, 31 July 2024

scientific article; zbMATH DE number 7631694
Language Label Description Also known as
English
Optimal parametric search on graphs of bounded tree-width
scientific article; zbMATH DE number 7631694

    Statements

    Optimal parametric search on graphs of bounded tree-width (English)
    0 references
    0 references
    0 references
    9 December 2022
    0 references

    Identifiers