Linear layouts of weakly triangulated graphs

DOI10.1142/S1793830916500385zbMATH Open1388.68238OpenAlexW2315491415MaRDI QIDQ2821101FDOQ2821101

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

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

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)

Cites Work

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

Cited In (4)

• A separator-based method for generating weakly chordal graphs
• Generating weakly chordal graphs from arbitrary graphs
• Linear layouts of weakly triangulated graphs
• Title not available (Why is that?)

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)