Pages that link to "Item:Q1198058"
From MaRDI portal
The following pages link to Optimal parallel time bounds for the maximum clique problem on intervals (Q1198058):
Displaying 10 items.
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Efficient parallel recognition of some circular arc graphs. II (Q675297) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Aliased register allocation for straight-line programs is NP-complete (Q954999) (← links)
- Optimal circular arc representations: Properties, recognition, and construction (Q1271617) (← links)
- Optimal computation of shortest paths on doubly convex bipartite graphs (Q1963107) (← links)
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
- ON THE POWER OF SOME PRAM MODELS (Q4242705) (← links)
- A parallel algorithm to generate all maximal independent sets on permutation graphs (Q4392327) (← links)
- PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS (Q5248988) (← links)
