Abstract
Let V( G) be the vertex set of a graph G = ( V,E), and let G — u be the subgraph induced by the vertex set V( G) - { u}. A vertex u ε V( G) is said to be a hinge vertex of G if and only if there exist two vertices x, y ε V( G-u) such that d G — u ( x,y) > d G ( x,y), where d G ( x, y) is the distance (the length of a shortest path) between x and y in G. In this paper, based on the breadth-first search technique, an O( n+ e) time algorithm is proposed for finding the set of all hinge vertices of a strongly chordal graph when a strong elimination ordering is given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
