Upward Point-Set Embeddability (Q3075525)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Upward Point-Set Embeddability	scientific article

Statements

scholarly article

0 references

Upward Point-Set Embeddability (English)

0 references

0 references

Michael Kaufmann

0 references

Tamara Mchedlidze

0 references

Antonios Symvonis

0 references

SOFSEM 2011: Theory and Practice of Computer Science

0 references

publication date

15 February 2011

0 references

full work available at URL

https://arxiv.org/abs/1010.5937

0 references

MaRDI profile type

MaRDI publication profile

0 references

Upward Geometric Graph Embeddings into Point Sets

0 references

Upward straight-line embeddings of directed graphs into point sets

0 references

On embedding an outer-planar graph in a point set

0 references

Optimal Algorithms to Embed Trees in a Point Set

0 references

Planar embeddability of the vertices of a graph using a fixed point set is NP-hard

0 references

0 references

On upward point set embeddability

0 references

Computing Upward Topological Book Embeddings of Upward Planar Digraphs

0 references

Stack and Queue Layouts of Directed Acyclic Graphs: Part I

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-18381-2_23

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3075525

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3075525&oldid=35214349"