Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: NP-completeness of edge-colouring some restricted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel recognition of the consecutive ones property with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for some graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel algorithm for planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient parallel strong orientation / rank
 
Normal rank

Revision as of 10:18, 27 May 2024

scientific article
Language Label Description Also known as
English
Efficient parallel algorithms for doubly convex-bipartite graphs
scientific article

    Statements

    Identifiers