Intractability in graph drawing and geometry: FPT approaches

DOI10.1007/978-3-642-10217-2_5MaRDI QIDQ3651531zbMATH OpenOpenAlexFDO

Authors Sue Whitesides

Publication date 11 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10217-2_5

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) General topics in the theory of computing (68Q01) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the parameterized complexity of layered graph drawing
• Bidimensionality: new connections between FPT algorithms and PTASs
• scientific article; zbMATH DE number 1756013
• Graph Drawing
• Parameterized analysis and crossing minimization problems

Cited in

(1)

• Fixed edge-length graph drawing is NP-hard

This page was built for publication: Intractability in graph drawing and geometry: FPT approaches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651531)