Embedding into the rectilinear grid

DOI<127::AID-NET5>3.0.CO;2-D 10.1002/(SICI)1097-0037(199809)32:2<127::AID-NET5>3.0.CO;2-DzbMath0991.54012OpenAlexW2130335163MaRDI QIDQ4540071

Victor Chepoi, Hans-Jürgen Bandelt

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199809)32:2<127::aid-net5>3.0.co;2-d

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Embedding (54C25)

Related Items (3)

A \(T_X\)-approach to some results on cuts and metrics ⋮ Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete ⋮ Embedding into the rectilinear plane in optimal \(O(n^{2})\) time

This page was built for publication: Embedding into the rectilinear grid