An efficient algorithm for finding all hinge vertices on trapezoid graphs

DOI10.1007/S00224-002-1004-3MaRDI QIDQ1405798zbMATH OpenOpenAlexFDO

Authors Debashis Bera, Madhumangal Pal, Tapan K. Pal

Publication date 26 August 2003

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-002-1004-3

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• A linear time algorithm for finding all hinge vertices of a permutation graph
• The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs
• An efficient distributed algorithm for finding all hinge vertices in networks
• scientific article; zbMATH DE number 5711694
• The recognition of geodetically connected graphs

Cited in

(7)

• Efficient algorithm for the vertex connectivity of trapezoid graphs
• Algorithms and complexity of \(s\)-club cluster vertex deletion
• Erratum and addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph
• The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs
• A linear time algorithm for finding all hinge vertices of a permutation graph
• An efficient algorithm to solve connectivity problem on trapezoid graphs
• An efficient distributed algorithm for finding all hinge vertices in networks

This page was built for publication: An efficient algorithm for finding all hinge vertices on trapezoid graphs

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