scientific article; zbMATH DE number 1522948
From MaRDI portal
Publication:4511244
zbMATH Open0966.05073MaRDI QIDQ4511244FDOQ4511244
Authors: Binay Bhattacharya, Michael E. Houle 
Publication date: 12 August 2001
Title of this publication is not available (Why is that?)
Recommendations
- An optimal time algorithm for finding a maximum weight independent set in a tree
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree
- Algorithms for maximum independent sets
- scientific article; zbMATH DE number 1303580
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (8)
- Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
- An optimal time algorithm for finding a maximum weight independent set in a tree
- Powers of geometric intersection graphs and dispersion algorithms
- Fully dynamic maximal independent set with sublinear update time
- Targeted Branching for the Maximum Independent Set Problem
- Dispersion on trees
- Efficient computation of tolerances in the weighted independent set problem for trees
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs
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 Q4511244)
