ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph

Chandran, LS (2001) A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph. In: 7th Annual International Computing and Combinatorics Conference,COCOON'01 (Lecture Notes in Computer Science), 20-23 Aug 2001, Guilin, China, pp. 308-317.

[img] PDF
A_Linear_Time_Algorithm_for_Enumerating.pdf
Restricted to Registered users only

Download (164Kb) | Request a copy

Abstract

We give O(m + n) algorithms for enumerating all minimum separators as well as minimal separators in a connected chordal graph. We give a tight upper bound, n - κ(G) - 1, for the number of minimal separators in a chordal graph. An important contribution of the paper is our characterisation of minimal (minimum) separators of chordal graphs and the above results are obtained as consequences of the characterisations

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to Springer-Verlag.
Keywords: Computational geometry;Graph theory
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 05 Nov 2007
Last Modified: 19 Sep 2010 04:36
URI: http://eprints.iisc.ernet.in/id/eprint/10551

Actions (login required)

View Item View Item