Pages that link to "Item:Q1108808"

The following pages link to A parallelizable lexicographically first maximal edge-induced subgraph problem (Q1108808):

Displaying 4 items.

• The lexicographically first topological order problem is NLOG-complete (Q582104) (← links)
• Using maximal independent sets to solve problems in parallel (Q672378) (← links)
• \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
• The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355) (← links)