Additive tree 2-spanners of permutation graphs (Q3396414): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model classifying algorithms as inherently sequential with applications to graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree 3-spanners on interval, permutation and regular bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems / rank
 
Normal rank

Latest revision as of 00:08, 2 July 2024

scientific article
Language Label Description Also known as
English
Additive tree 2-spanners of permutation graphs
scientific article

    Statements