Pages that link to "Item:Q3315441"
From MaRDI portal
The following pages link to On the np-completeness of certain network testing problems (Q3315441):
Displaying 11 items.
- The efficiency of AC graphs (Q686253) (← links)
- A lower bound on the period length of a distributed scheduler (Q689104) (← links)
- Maximal selection in tandem networks with symmetric hearing range (Q1117904) (← links)
- NP-completeness of some generalizations of the maximum matching problem (Q1168728) (← links)
- A pie allocation among sharing groups (Q1384021) (← links)
- Donation center location problem (Q1949758) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- On the np-completeness of certain network testing problems (Q3315441) (← links)
- Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Induced matchings in strongly biconvex graphs and some algebraic applications (Q6081912) (← links)
