Vertex Intersection Graphs of Paths on a Grid

@article{Asinowski2012VertexIG,
  title={Vertex Intersection Graphs of Paths on a Grid},
  author={Andrei Asinowski and Elad Cohen and Martin Charles Golumbic and Vincent Limouzy and Marina Lipshteyn and Michal Stern},
  journal={J. Graph Algorithms Appl.},
  year={2012},
  volume={16},
  pages={129-150}
}
We investigate the class of vertex intersection graphs of paths on a grid, and specifically consider the subclasses that are obtained when each path in the representation has at most k bends (turns). We call such a subclass the Bk-VPG graphs, k ≥ 0. In chip manufacturing, circuit layout is modeled as paths (wires) on a grid, where it is natural to constrain the number of bends per wire for reasons of feasibility and to reduce the cost of the chip. If the number k of bends is not restricted… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 25 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Topology of thin film circuits

  • F. Sinden
  • Bell System Tech. J.,
  • 1966
Highly Influential
6 Excerpts

Single bend paths on a grid have strong helly number

  • M. C. Golumbic, M. Lipshteyn, M. Stern
  • 2010
2 Excerpts

Similar Papers

Loading similar papers…