Linear layouts of weakly triangulated graphs

DOI10.1142/S1793830916500385zbMath1388.68238OpenAlexW2315491415MaRDI QIDQ2821101

No author found.

Publication date: 16 September 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830916500385

zbMATH Keywords

rigiditygraph embeddingweakly triangulated graphs

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Data structures (68P05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Generating weakly chordal graphs from arbitrary graphs ⋮ A separator-based method for generating weakly chordal graphs

Cites Work

• Problems of distance geometry and convex properties of quadratic maps
• An efficient algorithm for finding a two-pair, and its applications
• Point placement on the line by distance data.
• Improved algorithms for weakly chordal graphs
• Fitting points on the real line and its application to RH mapping

This page was built for publication: Linear layouts of weakly triangulated graphs