Sets approach algorithms for determination of component minimal complete subgraph

MaRDI QIDQ4619894zbMATH OpenFDO

Authors Silviu Barza

Publication date 7 February 2019

zbMATH Keywords

complete graphssubgraphs

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A better sets approach algorithm for the determination of component minimal complete subgraph
• 0-1 algebraic approach algorithm for the determination of component minimal complete subgraph
• Some considerations about component p-vertexes complete subgraph
• Some consideration about component minimal complete subgraph
• scientific article; zbMATH DE number 3887732

Cited in

(7)

• scientific article; zbMATH DE number 4029292 (Why is no real title available?)
• scientific article; zbMATH DE number 1215120 (Why is no real title available?)
• scientific article; zbMATH DE number 1973993 (Why is no real title available?)
• A better sets approach algorithm for the determination of component minimal complete subgraph
• 0-1 algebraic approach algorithm for the determination of component minimal complete subgraph
• Some consideration about component minimal complete subgraph
• Some considerations about component p-vertexes complete subgraph

This page was built for publication: Sets approach algorithms for determination of component minimal complete subgraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4619894)