Concepedia

The Linear Arrangement Problem Parameterized Above Guaranteed Value

Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo

Theory of Computing Systems · 2007 · 56 citations · 12 references

DOI

Concepts

References

12

Depth-First Search and Linear Graph Algorithms

Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations

, , +16

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

, , +12

Some simplified NP-complete graph problems

M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations

, , +11

Optimal Assignments of Numbers to Vertices

L. H. Harper · Journal of the Society for Industrial and Applied Mathematics · 1964 · 432 citations

, , +10

Parameterizing above Guaranteed Values: MaxSat and MaxCut

Meena Mahajan, Venkatesh Raman · Journal of Algorithms · 1999 · 310 citations

, , +9