scientific article; zbMATH DE number 4198027

MaRDI QIDQ5203035zbMATH OpenFDO

Authors Julin Wu

Publication date 1991

zbMATH Keywords

linear time algorithmchordal graphmaximum weightstrongly independent set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Domination, independent domination, and duality in strongly chordal graphs
• Algorithms and Computation
• Counting the number of independent sets in chordal graphs
• Maximum vertex-weighted matching in strongly chordal graphs
• Detecting strong cliques

Cited in

(3)

• Detecting strong cliques
• Hypergraphs and the Clar problem in hexagonal systems
• Finding a maximum-weight convex set in a chordal graph

This page was built for publication:

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