scientific article; zbMATH DE number 3165199
From MaRDI portal
Publication:3283487
Cited in
(16)- A linear algorithm for embedding planar graphs using PQ-trees
- Improved planarity algorithms
- Reconstruction graphs and testing their properties in a relational spatial database
- Facilities layout generalized model solved by n-boundary shortest path heuristics
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- On Boolean characterizations of planarity and planar embeddings of graphs
- Alcuni sviluppi sulla teoria relativa dei singrammi finiti
- On the decomposition of a complete graph into planar subgraphs
- An algorithm for straight-line representation of simple planar graphs
- Jordan circuits of a graph
- Simultaneous orthogonal planarity
- Boolean planarity characterization of graphs
- Boolean approach to planar embeddings of a graph
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- An annotated review on graph drawing and its applications
- String graph obstacles of high girth and of bounded degree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3283487)
