2011/02/06 by Vadim E. Levit, Levit, Vadim E., Eugen Mândrescu +1
Computer Science · #05C69 (Primary) 05C70(Secondary) #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1102.1141
openalex publication_date 2011/02/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.