scientific article; zbMATH DE number 3797792

MaRDI QIDQ4742818zbMATH OpenFDO

Authors G. Sh. Fridman, Victor Petrovich Il'ev

Publication date 1982

zbMATH Keywords

complete bipartite graphcomplete graphconnected componentdistance between graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Cited in

(8)

• A method of enumeration of negative cycles of a signed graph
• Graph clustering with a constraint on cluster sizes
• On the polytope faces of the graph approximation problem
• 2-approximation algorithms for two graph clustering problems
• On a semi-supervised graph clustering problem
• scientific article; zbMATH DE number 7746258 (Why is no real title available?)
• On cluster editing problem with clusters of small sizes
• Clustering complexity and an approximation algorithm for a version of the cluster editing problem

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