Graph Layout Problems Parameterized by Vertex Cover

@inproceedings{Fellows2008GraphLP,
  title={Graph Layout Problems Parameterized by Vertex Cover},
  author={Michael R. Fellows and Daniel Lokshtanov and Neeldhara Misra and Frances A. Rosamond and Saket Saurabh},
  booktitle={ISAAC},
  year={2008}
}
In the framework of parameterized complexity, one of the most commonly used structural parameters is the treewidth of the input graph. The reason for this is that most natural graph problems turn out to be fixed parameter tractable when parameterized by treewidth. However, Graph Layout problems are a notable exception. In particular, no fixed parameter tractable algorithms are known for the Cutwidth, Bandwidth, Imbalance and Distortion problems parameterized by treewidth. In fact, Bandwidth… CONTINUE READING
BETA

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 66 CITATIONS, ESTIMATED 96% COVERAGE

FILTER CITATIONS BY YEAR

2009
2019

CITATION STATISTICS

  • 6 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 31 REFERENCES

An Illustration Using Bounded Max Leaf Number

M. R. Fellows, Frances A. Rosamond. The Complexity Ecology of Parameters
  • In the Proceedings of CiE, LNCS 4497, 268-277
  • 2007
VIEW 1 EXCERPT

Algorithms for partial w-trees of bounded degree

D. M. Thilikos, M. J. Serna, H. L. Bodlaender. Cutwidth
  • J. Algorithms 56(1): 25-49
  • 2005
VIEW 1 EXCERPT

Complexity of integer quasiconvex polynomial optimization

S. Heinz
  • Journal of Complexity
  • 2005
VIEW 1 EXCERPT