scientific article; zbMATH DE number 1305522
From MaRDI portal
Publication:4252414
zbMath0929.68089MaRDI QIDQ4252414
Mario Szegedy, David S. Johnson
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Genus characterizes the complexity of certain graph problems: Some tight results ⋮ Simultaneous feedback edge set: a parameterized perspective ⋮ The Time Complexity of Constraint Satisfaction ⋮ Exact algorithms for dominating set ⋮ Sparsification and subexponential approximation ⋮ Finding Points in General Position ⋮ Computing the number of induced copies of a fixed graph in a bounded degree graph ⋮ The ordered covering problem ⋮ A note on the fine-grained complexity of MIS on regular graphs ⋮ Efficiency in exponential time for domination-type problems ⋮ On parameterized exponential time complexity ⋮ Defensive alliances in graphs ⋮ Pathwidth of cubic graphs and exact algorithms ⋮ Offensive alliances in graphs ⋮ Which problems have strongly exponential complexity?
