Knowledge Discovery in Graphs Through Vertex Separation

DOI10.1007/978-3-319-57351-9_25zbMath1454.68131OpenAlexW2607363831MaRDI QIDQ3305126

Catherine Mancel, Marc Sarfati, Marc Queudot, 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

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

Uses Software

• CSparse

Cites Work

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

This page was built for publication: Knowledge Discovery in Graphs Through Vertex Separation