scientific article; zbMATH DE number 4135976

zbMATH Open0694.05036MaRDI QIDQ3469115FDOQ3469115

Authors: Ranjan Kumar Sen 

Publication date: 1990

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

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

zbMATH Keywords

graph algorithmsoptimization problemminimum edge deletion

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (5)

• Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
• Title not available (Why is that?)
• A Note on the Minimum H-Subgraph Edge Deletion
• Title not available (Why is that?)
• Approximation algorithms for minimum chain vertex deletion

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)