The following pages link to (Q3283487):
Displaying 14 items.
- A linear algorithm for embedding planar graphs using PQ-trees (Q1083864) (← links)
- Improved planarity algorithms (Q1161292) (← links)
- Reconstruction graphs and testing their properties in a relational spatial database (Q1609074) (← links)
- Facilities layout generalized model solved by n-boundary shortest path heuristics (Q1820668) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- On Boolean characterizations of planarity and planar embeddings of graphs (Q2276969) (← links)
- Alcuni sviluppi sulla teoria relativa dei singrammi finiti (Q2531019) (← links)
- On the decomposition of a complete graph into planar subgraphs (Q2541350) (← links)
- An algorithm for straight-line representation of simple planar graphs (Q2543147) (← links)
- Jordan circuits of a graph (Q2546875) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- Boolean planarity characterization of graphs (Q3824429) (← links)
- Boolean approach to planar embeddings of a graph (Q4271303) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
