Pages that link to "Item:Q4699162"
From MaRDI portal
The following pages link to Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine (Q4699162):
Displaying 19 items.
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671) (← links)
- Drawing colored graphs on colored points (Q959802) (← links)
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph (Q1304472) (← links)
- Optimum embedding of complete graphs in books (Q1379820) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- On exteriority notions in book embeddings and treewidth (Q2297721) (← links)
- Two-page book embedding of trees under vertex-neighborhood constraints (Q2367407) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- Embeddability Problems for Upward Planar Digraphs (Q3611856) (← links)
- (Q3691751) (← links)
- Relating Graph Thickness to Planar Layers and Bend Complexity (Q4556953) (← links)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (Q4727445) (← links)
- The book crossing number of a graph (Q4879178) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS (Q5493895) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
