Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile

1980/01/01 by Najiba Sbihi · 4 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Art #Combinatorics #Graph theory and applications #Humanities #Interconnection Networks and Systems #Mathematics

paper · doi:10.1016/0012-365x(90)90287-r

crossref issued 1980/01/01 · crossref published 1980/01/01 · crossref published-print 1980/01/01 · openalex publication_date 1980/01/01 · crossref created 2002/07/25 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/04/05 · crossref indexed 2026/06/14

Citations

• On maximal independent sets of vertices in claw-free graphs
• Paths, Trees, and Flowers

Cited by

• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Classes of perfect graphs
• Independent Set on P_k-Free Graphs in Quasi-Polynomial Time
• Independent set (graph theory) [wikipedia]