Pages that link to "Item:Q1187028"

The following pages link to A model classifying algorithms as inherently sequential with applications to graph searching (Q1187028):

Displaying 6 items.

• The parallel complexity of approximating the high degree subgraph problem (Q1275085) (← links)
• A theory of strict P-completeness (Q1337145) (← links)
• Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
• Additive tree 2-spanners of permutation graphs (Q3396414) (← links)
• The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810) (← links)
• The parallel complexity of approximating the High Degree Subgraph problem (Q6487954) (← links)