Isometric Diamond Subgraphs
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites work
- A decomposition theorem for partially ordered sets
- Cubic partial cubes from simplicial arrangements
- Distance-preserving subgraphs of hypercubes
- Graph Drawing
- Isometric embedding in products of complete graphs
- Media theory. Interdisciplinary applied mathematics.
- Recognition algorithms for orders of small width and graphs of small Dilworth number
- Recognizing partial cubes in quadratic time
- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
- The complexity of minimizing wire lengths in VLSI layouts
- The lattice dimension of a graph
- The logic engine and the realization problem for nearest neighbor graphs
Cited in
(5)
This page was built for publication: Isometric Diamond Subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611874)