Linear layouts of weakly triangulated graphs

DOI10.1142/S1793830916500385MaRDI QIDQ2821101zbMATH OpenOpenAlexFDO

Authors Asish Mukhopadhyay, S. V. Rao, Sidharth Pardeshi, Srinivas Gundlapalli

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

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

Recommendations

• Linear layouts of weakly triangulated graphs
• Weakly triangulated graphs
• Weakly Triangulated Comparability Graphs
• Optimizing weakly triangulated graphs
• Recognizing weakly triangulated graphs by edge separability

Cites work

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

Cited in

(4)

• A separator-based method for generating weakly chordal graphs
• scientific article; zbMATH DE number 4049689 (Why is no real title available?)
• Linear layouts of weakly triangulated graphs
• Generating weakly chordal graphs from arbitrary graphs

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

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