Computer Science – Discrete Mathematics
Scientific paper
2011-02-06
Computer Science
Discrete Mathematics
8 pages, 5 figures
Scientific paper
A set S of vertices is independent in a graph G if no two vertices from S are adjacent, and alpha(G) is the cardinality of a maximum independent set of G. G is called a Konig-Egervary graph if its order equals alpha(G)+mu(G), where mu(G) denotes the size of a maximum matching. By core(G) we mean the intersection of all maximum independent sets of G. To decide whether core(G) is empty is known to be NP-hard. In this paper, we present some polynomial time algorithms finding core(G) of a Konig-Egervary graph G.
Levit Vadim E.
Mandrescu Eugen
No associations
LandOfFree
An Algorithm Computing the Core of a Konig-Egervary Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Algorithm Computing the Core of a Konig-Egervary Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithm Computing the Core of a Konig-Egervary Graph will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-506039