scientific article; zbMATH DE number 4135976

MaRDI QIDQ3469115zbMATH OpenFDO

Authors Ranjan Kumar Sen

Publication date 1990

zbMATH Keywords

graph algorithmsminimum edge deletionoptimization problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 4150228
• Algorithm Engineering for Optimal Graph Bipartization
• Linear-Time Approximation Algorithms for the Max Cut Problem
• Experimental and Efficient Algorithms
• Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization

Cited in

(6)

• Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
• A Note on the Minimum H-Subgraph Edge Deletion
• Approximation algorithms for minimum chain vertex deletion
• scientific article; zbMATH DE number 4150228 (Why is no real title available?)
• scientific article; zbMATH DE number 4029292 (Why is no real title available?)
• Approximating Clique and Biclique Problems

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