Pages that link to "Item:Q808288"

The following pages link to An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288):

Displaying 2 items.

• Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
• The maximum clique problem (Q1318271) (← links)