scientific article; zbMATH DE number 847156

MaRDI QIDQ4864968zbMATH OpenFDO

Authors Songnian Zhu, Qiang Zhu

Publication date 25 February 1996

zbMATH Keywords

negative envelope graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Network decomposition and maximum independent set. II: Application research
• Constructing a Maximal Independent Set in Parallel
• A fast parallel algorithm for the maximal independent set problem
• Algorithms for maximum independent sets
• Maximum independent number for series-parallel networks

Cited in

(6)

• On generating all maximal independent sets
• Matrix formulation of EISs of graphs and its application to WSN covering problems
• Exact Algorithms for Maximum Independent Set
• A fine-grained analysis of a simple independent set algorithm
• Listing Maximal Independent Sets with Minimal Space and Bounded Delay
• Network decomposition and maximum independent set. II: Application research

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 Q4864968)