On the np-completeness of certain network testing problems
From MaRDI portal
Publication:3315441
DOI10.1002/net.3230140102zbMath0532.94017OpenAlexW2057904195MaRDI QIDQ3315441
No author found.
Publication date: 1984
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230140102
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)
Related Items (11)
Maximal selection in tandem networks with symmetric hearing range ⋮ A pie allocation among sharing groups ⋮ Parameterized complexity of perfectly matched sets ⋮ Induced matchings in strongly biconvex graphs and some algebraic applications ⋮ Donation center location problem ⋮ NP-completeness of some generalizations of the maximum matching problem ⋮ Maximum induced matching algorithms via vertex ordering characterizations ⋮ On the np-completeness of certain network testing problems ⋮ The efficiency of AC graphs ⋮ A lower bound on the period length of a distributed scheduler ⋮ Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
Cites Work
This page was built for publication: On the np-completeness of certain network testing problems
