Metric space method for constructing splitting partitions of graphs

DOI10.2478/AUSI-2019-0009MaRDI QIDQ2178736zbMATH OpenOpenAlexWikidataFDO

Authors Sándor Szabó

Publication date 11 May 2020

Published in Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/ausi-2019-0009

zbMATH Keywords

maximum cliqueclique numberbranching rules

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Recommendations

• On clique partitions of split graphs
• scientific article; zbMATH DE number 7192822
• The branch and cut method for the clique partitioning problem
• The clique-partitioning problem
• The metric cutpoint partition problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• A fast algorithm for the maximum clique problem
• An exact algorithm for the maximum clique problem
• Monotonic matrices and clique search in graphs

Cited in

(2)

• The metric bridge partition problem: Partitioning of a metric space into two subspaces linked by an edge in any optimal realization
• Splitting Edge Partitions of Graphs

This page was built for publication: Metric space method for constructing splitting partitions of graphs

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