Optimal parallel algorithms on circular-arc graphs (Q1263980): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/0020-0190(89)90195-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W28739840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum cliques on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel algorithm for planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Test for Circular-Arc Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:02, 20 June 2024

scientific article
Language Label Description Also known as
English
Optimal parallel algorithms on circular-arc graphs
scientific article

    Statements

    Identifiers