scientific article; zbMATH DE number 1182770

zbMATH Open0908.05053MaRDI QIDQ4400853FDOQ4400853

Authors: Ingo Schiermeyer 

Publication date: 25 October 1998

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1003268
• scientific article; zbMATH DE number 753971
• Improved approximations of independent sets in bounded-degree graphs
• Approximating maximum independent sets by excluding subgraphs
• Approximating maximum independent sets by excluding subgraphs

zbMATH Keywords

cliqueindependent setindependence number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35)

Cited In (11)

• An optimal maximal independent set algorithm for bounded-independence graphs
• Title not available (Why is that?)
• Interpolating between bounds on the independence number
• A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs
• Independence in connected graphs
• Maximal independent sets in clique-free graphs
• Improved lower bounds for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE
• An approximation algorithm for the maximum independent set problem in cubic planar graphs
• Rank and chromatic number of a graph
• Approximating Maximum Clique by Removing Subgraphs
• A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-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 Q4400853)