Incompatibility graphs in data mining

DOI10.1007/S11750-026-00717-6MaRDI QIDQ7356088zbMATH OpenFDO

Authors Endre Boros, Federica Ricca, Vincenzo Spinelli

Publication date 23 September 2026

Published in Top (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11750-026-00717-6

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Cites work

• Abstract Voronoi diagrams revisited
• Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging
• Classifying negative and positive points by optimal box clustering
• Comparison of convex hulls and box hulls.
• Covering with Euclidean boxes
• Extended box clustering for classification problems
• Finding essential attributes from binary data
• Generating weakly chordal graphs from arbitrary graphs
• Graph classes and forbidden patterns on three vertices
• Grouping Multidimensional Data
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4164874 (Why is no real title available?)
• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 2209732 (Why is no real title available?)
• Improved algorithms for weakly chordal graphs
• List-\(k\)-coloring \(H\)-free graphs for all \(k>4\)
• Logical analysis of data -- an overview: from combinatorial optimization to medical applications
• Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten.
• On generating all maximal independent sets
• On graphs with polynomially solvable maximum-weight clique problem
• Permutation Graphs and Transitive Graphs
• Practical graph isomorphism. II.
• Pruning boxes in a box-based classification method
• Saturated systems of homogeneous boxes and the logical analysis of numerical data
• Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
• Supervised box clustering
• The maximum box problem and its application to data analysis
• Transitiv orientierbare Graphen
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Über den Variabilitätsbereich der Fourierschen Konstanten von positiven harmonischen Funktionen.
• Über Mengen konvexer Körper mit gemeinschaftlichen Punkten.

This page was built for publication: Incompatibility graphs in data mining

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