An efficient algorithm for finding all hinge vertices on trapezoid graphs
From MaRDI portal
Publication:1405798
DOI10.1007/s00224-002-1004-3zbMath1039.68088MaRDI QIDQ1405798
Madhumangal Pal, Debashis Bera, Tapan Kumar 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
Related Items
An efficient distributed algorithm for finding all hinge vertices in networks, Efficient algorithm for the vertex connectivity of trapezoid graphs, Erratum and addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph, Algorithms and complexity of \(s\)-club cluster vertex deletion