Network decomposition and maximum independent set. II: Application research

MaRDI QIDQ5483094zbMATH OpenFDO

Authors Songnian Zhu, Qiang Zhu

Publication date 16 August 2006

zbMATH Keywords

polynomial time boundspanning tree algorithmnegative envelope graphadjusting searchnetwork transformation and decompositionpicking-off searchpseudo-negative envelope graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• Publication:4864968
• Algorithms for maximum independent sets
• Maximum independent number for series-parallel networks
• Constructing a Maximal Independent Set in Parallel
• A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs

Cited in

(1)

• scientific article; zbMATH DE number 847156 (Why is no real title available?)

This page was built for publication: Network decomposition and maximum independent set. II: Application research

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