Pages that link to "Item:Q3975140"
From MaRDI portal
The following pages link to Parallel complexity of lexicographically first problems for tree- structured graphs (Q3975140):
Displaying 4 items.
- A P-complete graph partition problem (Q917313) (← links)
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
- Graph coloring on coarse grained multicomputers (Q1408826) (← links)
- The parallel complexity of tree embedding problems (extended abstract) (Q5096766) (← links)