The cardinality of the collection of maximum independent sets of a functional graph

DOI10.1006/AAMA.1996.0509zbMATH Open0869.05034OpenAlexW2045046362MaRDI QIDQ678609FDOQ678609

Authors: Shu-Chu Chang, Yeong-Nan Yeh 

Publication date: 14 August 1997

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.1996.0509

Recommendations

• scientific article; zbMATH DE number 2188478
• Heuristic algorithm for finding the maximum independent set
• scientific article; zbMATH DE number 1439474
• scientific article; zbMATH DE number 2050882
• Extending the MAX algorithm for maximum independent set

zbMATH Keywords

stability numberfunctional digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35)

Cites Work

• On the Shannon capacity of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Graphs with the second largest number of maximal independent sets
• The number of maximal independent sets in connected triangle-free graphs

This page was built for publication: The cardinality of the collection of maximum independent sets of a functional graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q678609)