Parallel approximation schemes for problems on planar graphs (Q1924999): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A simple parallel tree contraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Depth-First Search in $O(\log n)$ Parallel Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing connected components on parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Complexity of the Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for approximating the minimum cycle cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel approximation algorithm for positive linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs: Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel approximation schemes for subset sum and knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating linear programming is log-space complete for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484351 / rank
 
Normal rank

Latest revision as of 14:25, 24 May 2024

scientific article
Language Label Description Also known as
English
Parallel approximation schemes for problems on planar graphs
scientific article

    Statements

    Identifiers