Pages that link to "Item:Q4729355"
From MaRDI portal
The following pages link to The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355):
Displaying 8 items.
- Using maximal independent sets to solve problems in parallel (Q672378) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
- Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202) (← links)
- On the Parameterized Parallel Complexity and the Vertex Cover Problem (Q2958339) (← links)
- The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
- A MEASURE FOR THE LEXICOGRAPHICALLY FIRST MAXIMAL INDEPENDENT SET PROBLEM AND ITS LIMITS (Q5249021) (← links)
