Knowledge discovery in graphs through vertex separation

DOI10.1007/978-3-319-57351-9_25MaRDI QIDQ3305126zbMATH OpenOpenAlexFDO

Authors Marc Sarfati, Marc Queudot, Catherine Mancel, Marie-Jean Meurs

Publication date 5 August 2020

Published in Advances in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://hal-enac.archives-ouvertes.fr/hal-01521890/file/vsp-cai2017.pdf

zbMATH Keywords

graph partitioningknowledge discoveryvertex separator problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Recommendations

• The vertex separator problem: a polyhedral investigation
• Variable neighborhood search for the vertex separation problem
• An exact algorithm for solving the vertex separator problem
• The vertex separator problem: algorithms and computations
• scientific article; zbMATH DE number 2080096

Cites work

• A Separator Theorem for Planar Graphs
• An exact algorithm for solving the vertex separator problem
• Breakout local search for the quadratic assignment problem
• Continuous quadratic programming formulations of optimization problems on graphs
• Direct Methods for Sparse Linear Systems
• Finding all minimum-size separating vertex sets in a graph
• Finding good approximate vertex and edge partitions is NP-hard
• Graph clustering
• MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
• NP-completeness of the Planar Separator Problems
• The vertex separator problem: a polyhedral investigation
• The vertex separator problem: algorithms and computations

Describes a project that uses

Uses Software

• CSparse

This page was built for publication: Knowledge discovery in graphs through vertex separation

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