GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH

From MaRDI portal
Publication:5249047

DOI10.1142/S0129054100000211zbMath1320.05120OpenAlexW2031076941MaRDI QIDQ5249047

Olivier Cogis, Jean-Paul Bordat, Anne Berry

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054100000211




Related Items (34)

Minimal triangulations of graphs: a surveyA linear time algorithm to list the minimal separators of chordal graphsListing all the minimal separators of a 3-connected planar graphMinimal separators in \(P_4\)-sparse graphsRepresenting a concept lattice by a graphApproximately counting locally-optimal structuresApproximately Counting Locally-Optimal StructuresOn Distance-d Independent Set and Other Problems in Graphs with “few” Minimal SeparatorsA local approach to concept generationTreewidth computation and extremal combinatoricsFinding optimal triangulations parameterized by edge clique coverFinding a maximum minimal separator: graph classes and fixed-parameter tractabilitySome results on connected vertex separatorsA new characterization of unichord-free graphsLarge Induced Subgraphs via Triangulations and CMSOUnnamed ItemOn the hardness of inclusion-wise minimal separators enumerationUnnamed ItemUnnamed ItemOn the Maximum Weight Minimal SeparatorBeyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliquesThe PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.Minimal separators in extended \(P_4\)-laden graphsGraphical models for genetic analysesSolution methods for the vertex variant of the network system vulnerability analysis problemConditions for swappability of records in a microdata set when some marginals are fixedLinear separation of connected dominating sets in graphsOn the Number of Minimal Separators in GraphsBeyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal CliquesEmpirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-widenessMinimal separators in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>P</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-tidy graphsOn the maximum weight minimal separatorObservability-blocking control using sparser and regional feedback for network synchronization processesEfficiently decomposing, recognizing and triangulating hole-free graphs without diamonds



Cites Work


This page was built for publication: GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH